Surfaces, tree-width, clique-minors, and partitions
From MaRDI portal
Publication:1850479
DOI10.1006/jctb.2000.1962zbMath1029.05041OpenAlexW2089726838MaRDI QIDQ1850479
Guoli Ding, Dirk Vertigan, Daniel P. Sanders, Bogdan Oporowski
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3902b9cf7d8df8b4749464d9421d544a479f71b1
Related Items (19)
Hamiltonicity and generalised total colourings of planar graphs ⋮ Bounds of spectral radii on edge-most outer-planar bipartite graphs ⋮ Thickness of the subgroup intersection graph of a finite group ⋮ An annotated bibliography on 1-planarity ⋮ Some recent progress and applications in graph minor theory ⋮ The \(k\)-strong induced arboricity of a graph ⋮ Bounding tree-width via contraction on the projective plane and torus ⋮ New results on edge partitions of 1-plane graphs ⋮ Tree-width, clique-minors, and eigenvalues. ⋮ Extremal spectral radius of \(K_{3,3}/K_{2,4}\)-minor free graphs ⋮ On partitioning the edges of 1-plane graphs ⋮ Thickness and outerthickness for embedded graphs ⋮ Extension of a theorem of Whitney ⋮ Edge partitions of optimal 2-plane and 3-plane graphs ⋮ On vertex partitions and some minor-monotone graph parameters ⋮ Hadwiger’s Conjecture ⋮ Excluding any graph as a minor allows a low tree-width 2-coloring ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs ⋮ On Vertex Partitions and the Colin de Verdière Parameter
Cites Work
- Graph minors. III. Planar tree-width
- Forbidden minors characterization of partial 3-trees
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- On 2-connected spanning subgraphs with low maximum degree
- Disjoint paths in graphs
- On acyclic colorings of planar graphs
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- The four-colour theorem
- Excluding any graph as a minor allows a low tree-width 2-coloring
- Outerplanar partitions of planar graphs
- The point-arboricity of a graph
- Homomorphiesätze für Graphen
- Beweis einer Abschwächung der Hadwiger-Vermutung
- Graphs with forbidden subgraphs
- Graph minors. IV: Tree-width and well-quasi-ordering
- A Theorem on Planar Graphs
- An extremal function for contractions of graphs
- A characterization of partial 3-trees
- Characterization and Recognition of Partial 3-Trees
- Graph minors. II. Algorithmic aspects of tree-width
- A generalization of outerplanar graphs
- Every Planar Map is Four Colorable
- Contractions to k8
- Computing the orientable genus of projective graphs
- On Hamilton cycles in certain planar graphs
- On Linear Recognition of Tree-Width at Most Four
- The Point-Arboricity of Planar Graphs
- Decomposition of Finite Graphs Into Forests
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Surfaces, tree-width, clique-minors, and partitions