Graphs avoiding immersion of K_{3,3}
arXiv:1903.09011
Abstract
DeVos and Malekian gave a structural description of graphs avoiding an immersion of K_{3,3}, showing that all such graphs are composed over small edge-cuts from graphs with at most 8 vertices and from 3-regular planar graphs. We provide another proof of this fact, simpler in some aspects.
arXiv comment18 pages, 1 figure