Graphs avoiding immersion of K_{3,3}
Combinatorics
2019-03-22 v1
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.
Keywords
Cite
@article{arxiv.1903.09011,
title = {Graphs avoiding immersion of K_{3,3}},
author = {Zdeněk Dvořák and Michal Hruška},
journal= {arXiv preprint arXiv:1903.09011},
year = {2019}
}
Comments
18 pages, 1 figure