English

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 GG is a 3-connected graph with a K5K_5-minor and TT is a triangle of GG, then GG has a K5K_5-minor HH, such that E(T)\contE(H)E(T)\cont E(H). Other is that if GG is a 3-connected simple non-planar graph not isomorphic to K5K_5 and e,fE(G)e,f\in E(G), then GG has a minor HH such that e,fE(H)e,f\in E(H) and, up to isomorphisms, HH is one of the four non-isomorphic simple graphs obtained from K3,3K_{3,3} 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}
}