Abstract
Let k ≥ 1 be an integer, and let H be a graph with no isolated vertices embedded in the projective plane, such that every homotopically non-trivial closed curve intersects H at least k times, and the deletion and contraction of any edge in this embedding results in an embedding that no longer has this property. 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 in this way.
Cite
CITATION STYLE
Inkmann, T., & Thomas, R. (2011). Minor-Minimal Planar Graphs of even Branch-Width. Combinatorics Probability and Computing, 20(1), 73–82. https://doi.org/10.1017/S0963548310000283
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.