Graphs avoiding immersion of K3,3
Abstract
DeVos and Malekian gave a structural description of graphs avoiding an immersion of K3,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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.