English

Minor-minimal planar graphs of even branch-width

Combinatorics 2010-07-14 v2

Abstract

Let k>0 be an integer, let H be a minor-minimal graph in the projective plane such that every homotopically non-trivial closed curve intersects H at least k times, and let G be the planar double cover of H obtained by lifting G into the universal covering space of the projective plane, the sphere. We prove that G is minor-minimal of branch-width 2k. We also exhibit examples of minor-minimal planar graphs of branch-width 6 that do not arise this way.

Keywords

Cite

@article{arxiv.1007.0373,
  title  = {Minor-minimal planar graphs of even branch-width},
  author = {Torsten Inkmann and Robin Thomas},
  journal= {arXiv preprint arXiv:1007.0373},
  year   = {2010}
}

Comments

9 pages, to appear in Combinatorics, Probability and Computing

R2 v1 2026-06-21T15:43:53.791Z