Product structure of graphs with an excluded minor
This paper shows that Kt-minor-free (and Ks,t-minor-free) graphs G are subgraphs of products of a tree-like graph H (of bounded treewidth) and a complete graph Km. Our results include optimal bounds on the treewidth of H and optimal bounds (to within a constant factor) on m in terms of the number of...
Main Authors: | Illingworth, F, Scott, A, Wood, D |
---|---|
Format: | Journal article |
Language: | English |
Published: |
American Mathematical Society
2024
|
Similar Items
-
Independent sets in graphs with an excluded clique minor
by: David R. Wood
Published: (2007-01-01) -
Independent Sets in Graphs with an Excluded Clique Minor
by: David R. Wood
Published: (2007-01-01) -
Fast separation in a graph with an excluded minor
by: Bruce Reed, et al.
Published: (2005-01-01) -
Random Graphs Containing Few Disjoint Excluded Minors
by: McDiarmid, C, et al.
Published: (2014) -
Excluding pairs of graphs
by: Chudnovsky, M, et al.
Published: (2014)