On $K_5$ and $K_{3,3}$-minors of graphs and regular matroids
Combinatorics
2013-04-23 v1
Abstract
In this paper we prove two main results about obstruction to graph planarity. One is that, if is a 3-connected graph with a -minor and is a triangle of , then has a -minor , such that . Other is that if is a 3-connected simple non-planar graph not isomorphic to and , then has a minor such that and, up to isomorphisms, is one of the four non-isomorphic simple graphs obtained from by the addiction of \,0, 1 or 2 edges. We generalize this second result to the class of the regular matroids.
Keywords
Cite
@article{arxiv.1304.6076,
title = {On $K_5$ and $K_{3,3}$-minors of graphs and regular matroids},
author = {João Paulo Costalonga},
journal= {arXiv preprint arXiv:1304.6076},
year = {2013}
}