#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2014

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
- Electronic Notes in Discrete Mathematics
- 2016

A graph H is a square root of a graph G if G can be obtained from H by the addition of edges between any two vertices in H that are of distance 2 from each other. The Square Root problem is that of deciding whether a given graph admits a square root. We consider this problem for planar graphs in the context of the " distance from triviality " framework. For… (More)

- Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
- IWOCA
- 2016

- Elizabeth Hummelt, Danielle Kadrmas, +11 authors Elizabeth Zignego
- 2014

The problem of finding a disconnected cut in a graph is NP-hard in general but polynomial-time solvable on planar graphs. The problem of finding a minimal disconnected cut is also NP-hard but its computational complexity is not known for planar graphs. We show that it is polynomial-time solvable on 3-connected planar graphs but NP-hard for 2-connected… (More)

- Matthew Johnson, Daniël Paulusma, Anthony Stewart
- Discrete Applied Mathematics
- 2014

A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f (u) and f (v) of H whenever there is an edge between vertices u and v of G. The H-Colouring problem is to decide if a graph G allows a homomorphism to a fixed graph H. We continue a study on a variant… (More)

A graph H is a square root of a graph G if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of deciding whether a given graph admits a square root. This problem is only known to be NP-complete for chordal graphs and polynomial-time solvable for non-trivial minor-closed graph… (More)

- ‹
- 1
- ›