Bounding tree-width via contraction on the projective plane and torus
From MaRDI portal
Publication:888611
zbMath1323.05042MaRDI QIDQ888611
Publication date: 2 November 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p5
05C10: Planar graphs; geometric and topological aspects of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Cites Work
- Unnamed Item
- Forbidden minors characterization of partial 3-trees
- Surfaces, tree-width, clique-minors, and partitions
- Outerplanar partitions of planar graphs
- Approximation algorithms via contraction decomposition
- Graphs with forbidden subgraphs
- A Theorem on Planar Graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Edge partition of planar sraphs into two outerplanar graphs
- On Hamilton cycles in certain planar graphs