AbstractThe square of an undirected graph G is the graph G2 on the same vertex set such that there is an edge between two vertices in G2 if and only if they are at distance at most 2 in G. The kth power of a graph is defined analogously. It has been conjectured that the problem of computing any square root of a square graph, or even that of deciding whether a graph is a square, is NP-hard. We settle this conjecture in the affirmative
AbstractThis paper presents a solution to the problem of characterizing graphs that have at least on...
We show that the following two problems are fixed-parameter tractable with parameter k: testing whet...
We show that the following two problems are fixed-parameter tractable with parameter k: testing whet...
AbstractThe square of an undirected graph G is the graph G2 on the same vertex set such that there i...
Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of d...
The n-th power (n 1) of a graph G = (V; E), written G n , is defined to be the graph having V as ...
The square of a graph G, denoted by G(2), is obtained from G by putting an edge between two distinct...
We prove that it is NP-hard to decide whether a graph is the square of a 6-apex graph. This shows th...
The square of a graph G, denoted by G(2), is the graph obtained from G by putting an edge between tw...
The square of a graph G, denoted by G(2), is the graph obtained from G by putting an edge between tw...
The square of a given graph $H = (V, E)$ is obtained from $H$ by adding an edge between every two ve...
The square of a given graph $H = (V, E)$ is obtained from $H$ by adding an edge between every two ve...
International audienceThe square of a given graph $H = (V, E)$ is obtained from $H$ by adding an edg...
Deciding whether a given graph has a square root is a classical problem that has been studied extens...
Graph $G$ is the square of graph $H$ if two vertices $x,y$ have an edge in $G$ if and only if $x,y$ ...
AbstractThis paper presents a solution to the problem of characterizing graphs that have at least on...
We show that the following two problems are fixed-parameter tractable with parameter k: testing whet...
We show that the following two problems are fixed-parameter tractable with parameter k: testing whet...
AbstractThe square of an undirected graph G is the graph G2 on the same vertex set such that there i...
Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of d...
The n-th power (n 1) of a graph G = (V; E), written G n , is defined to be the graph having V as ...
The square of a graph G, denoted by G(2), is obtained from G by putting an edge between two distinct...
We prove that it is NP-hard to decide whether a graph is the square of a 6-apex graph. This shows th...
The square of a graph G, denoted by G(2), is the graph obtained from G by putting an edge between tw...
The square of a graph G, denoted by G(2), is the graph obtained from G by putting an edge between tw...
The square of a given graph $H = (V, E)$ is obtained from $H$ by adding an edge between every two ve...
The square of a given graph $H = (V, E)$ is obtained from $H$ by adding an edge between every two ve...
International audienceThe square of a given graph $H = (V, E)$ is obtained from $H$ by adding an edg...
Deciding whether a given graph has a square root is a classical problem that has been studied extens...
Graph $G$ is the square of graph $H$ if two vertices $x,y$ have an edge in $G$ if and only if $x,y$ ...
AbstractThis paper presents a solution to the problem of characterizing graphs that have at least on...
We show that the following two problems are fixed-parameter tractable with parameter k: testing whet...
We show that the following two problems are fixed-parameter tractable with parameter k: testing whet...
DOI
Add to ORKG