Square roots of minor closed graph classes

Authors:
Nestor V. Nestoridis;Dimitrios M. Thilikos
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 8
Cited 0

Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Algorithms for Square Roots of Graphs

SIAM Journal on Discrete Mathematics
Constructive Linear Time Algorithms for Branchwidth

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Branch decompositions and minor containment

Networks
Graph Minors. XX. Wagner's conjecture

Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Faster parameterized algorithms for minor containment

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

Let G be a graph class. The square root of G contains all graphs whose squares belong in G. We prove that if G is non-trivial and minor closed, then all graphs in its square root have carving-width bounded by some constant depending only on G. As a consequence, every square root of such a graph class has a linear time recognition algorithm.