Abstract
In 1992, Xiaoya Zha conjectured that the line graph of a 3-connected non-planar graph contains a subdivision of K 5. In this paper we prove this conjecture. This result is the main ingredient of [4] where a complete characterization of all the 4-connected claw-free graphs not containing a subdivision of K 5 is obtained.
Similar content being viewed by others
References
D. Archdeacon: Problems in topological graph theory, Manuscript, available online at: http://www.emba.uvm.edu/~archdeac/problems.
N. Biggs: Constructions for cubic graphs with large girth, Electronic Journal of Combinatorics 5 (1998), 56–62.
A. K. Kelmans: Graph planarity and related topics. in: Graph Structure Theory, pages 635–668, 1991.
R. Krakovski and D. C. Stephens: Structure of 4-connected claw-free graphs not containing a subdivision of K 5. Discrete Mathematics 311 (2011) 908–910.
L. Lovász: Combinatorial Problems and Exercises, AMS Chelsea Publishing, 2007 (and 1969).
W. Mader: 3n−5 edges do force a subdivision of K 5, Combinatorica 18 (1998) 569–595.
W. McCuaig: Edge reductions in cyclically-k-connected cubic graphs. J. Comb. Theory, Ser. B 56 (1992) 16–44.
B. Mohar and C. Thomassen: Graphs on surfaces, Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD, 2001.
N. Robertson, P. Seymour and R. Thomas: Tutte’s edge-colouring conjecture, Journal of Combinatorial Theory, Series B 70 (1997) 166–183.
N. Robertson, P. D. Seymour and R. Thomas: Non-planar extensions of planar graphs, Manuscript, 1999.
C. Thomassen: A refinement of Kuratowski’s theorem, J. Comb. Theory, Ser. B 37 (1984) 245–253.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Krakovski, R. Topological minors in line graphs — A proof of Zha’s conjecture. Combinatorica 34, 207–252 (2014). https://doi.org/10.1007/s00493-014-2721-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-014-2721-3