The obstructions for toroidal graphs with no 's
arXiv:math/0411488 · doi:10.1016/j.disc.2007.12.075
Abstract
Forbidden minors and subdivisions for toroidal graphs are numerous. We consider the toroidal graphs with no -subdivisions that coincide with the toroidal graphs with no -minors. These graphs admit a unique decomposition into planar components and have short lists of obstructions. We provide the complete lists of four forbidden minors and eleven forbidden subdivisions for the toroidal graphs with no 's and prove that the lists are sufficient.
10 pages, 7 figures, revised version with additional details
References in corpus (1)
Cited by in corpus (5)
- There is no triangulation of the torus with vertex degrees 5, 6, ..., 6, 7 and related results: Geometric proofs for combinatorial theorems
- Characterization and enumeration of toroidal K_{3,3}-subdivision-free graphs
- Classification of finite groups with toroidal or projective-planar permutability graphs
- Obstructions of Connectivity 2 for Embedding Graphs into the Torus
- Family sizes for complete multipartite graphs