Skip to main content Accessibility help
×
×
Home

Minor-Minimal Planar Graphs of Even Branch-Width

  • TORSTEN INKMANN (a1) and ROBIN THOMAS (a1)
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.

Copyright
References
Hide All
[1]Barnette, D. (1991) The minimal projective plane polyhedral maps. In Applied Geometry and Discrete Mathematics, Vol. 4 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., AMS, pp. 6370.
[2]Bodlaender, H. L. and Thilikos, D. M. (1999) Graphs with branchwidth at most three. J. Algorithms 32 167194.
[3]Dharmatilake, J. (1994) Binary matroids with branch-width three. PhD thesis, Ohio State University.
[4]Inkmann, T. (2008) Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem. PhD dissertation, Georgia Institute of Technology.
[5]Johnson, E. and Robertson, N. Private communication.
[6]Lins, S. (1981) A minimax theorem on circuits in projective graphs. J. Combin. Theory Ser. B 30 253262.
[7]Mohar, B. and Thomassen, C. (2001) Graphs on Surfaces, Johns Hopkins University Press.
[8]Randby, S. P. (1997) Minimal embeddings in the projective plane. J. Graph Theory 25 153164.
[9]Robertson, N. and Seymour, P. D. (1990) Graph minors IV: Tree-width and well-quasi-ordering. J. Combin. Theory Ser. B 48 227254.
[10]Schrijver, A. (1991) Decomposition of graphs on surfaces and a homotopic circulation theorem. J. Combin. Theory Ser. B 51 161210.
[11]Schrijver, A. (1992) On the uniqueness of kernels. J. Combin. Theory Ser. B 55 146160.
[12]Schrijver, A. (1994) Classification of minimal graphs of given representativity on the torus. J. Combin. Theory Ser. B 61 217236.
[13]Seymour, P. D. and Thomas, R. (1994) Call routing and the ratcatcher. Combinatorica 14 217241.
[14]Vitray, R. P. (1993) Representativity and flexibility on the projective plane. In Graph Structure Theory (Seattle, WA, 1991), Vol. 147 of Contemp. Math., AMS, pp. 341347.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed