Skip to main content
SpringerLink
Log in

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

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Universität Hannover, Institut für Mathematik, Welfengarten 1, D-30167, Hannover, Germany

    Wolfgang Mader

Authors
  1. Wolfgang Mader
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-005-0025-7

Mathematics Subject Classification (2000):

Search

Navigation