English

The structure of graphs with no K_{3,3} immersion

Combinatorics 2018-11-06 v2

Abstract

The Kuratowski-Wagner Theorem asserts that a graph is planar if and only if it does not have either K3,3K_{3,3} or K5K_5 as a minor. Using this Wagner obtained a precise description of all graphs with no K3,3K_{3,3} minor and all graphs with no K5K_5 minor. Similar results have been achieved for the class of graphs with no HH-minor for a number of small graphs HH. In this paper we give a precise structure theorem for graphs which do not contain K3,3K_{3,3} as an immersion. This strengthens an earlier theorem of Giannopoulou, Kami\'{n}ski, and Thilikos that gives a rough description of the class of graphs with no K3,3K_{3,3} or K5K_5 immersion.

Keywords

Cite

@article{arxiv.1810.12873,
  title  = {The structure of graphs with no K_{3,3} immersion},
  author = {Matt DeVos and Mahdieh Malekian},
  journal= {arXiv preprint arXiv:1810.12873},
  year   = {2018}
}

Comments

24 pages, 15 figures. arXiv admin note: text overlap with arXiv:1810.12863