Graphs With 3n−6 Edges Not Containing A Subdivision Of K 5

We determine all graphs on n ≥ 3 vertices with 3n-6 edges which do not contain a subdivision of K 5. These are exactly the graphs which one gets from any number of disjoint maximal planar graphs by successively pasting along triangles.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Wolfgang Mader.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Mader, W. Graphs With 3n−6 Edges Not Containing A Subdivision Of K 5 . Combinatorica 25, 425–438 (2005). https://doi.org/10.1007/s00493-005-0025-7

Download citation

Mathematics Subject Classification (2000):

  • 05C83
  • 05C35