Skip to main content
SpringerLink
Log in

The splitting number of the complete graph in the projective plane

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

If a given graphG can be obtained bys vertex identifications from a suitable graph embeddable in the projective plane ands is the minimum number for which this is possible thens is called the splitting number ofG in the projective plane. Here a formula for the splitting number of the complete graph in the projective plane is derived.

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

References

  1. Hartsfield, N. Jackson, B. Ringel, G.: The splitting number of the complete graph. Graphs and Combinatorics1, 311–329 (1985)

    Google Scholar 

  2. Jackson, B. Ringel, G.: Maps ofm-pires on the projective plane. Discrete Math.46, 15–20 (1983)

    Google Scholar 

  3. Ringel, G.: Map Color Theorem. New York: Springer-Verlag 1974

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Board, University of California, 95064, Santa Cruz, CA, USA

    Nora Hartsfield

Authors
  1. Nora Hartsfield
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hartsfield, N. The splitting number of the complete graph in the projective plane. Graphs and Combinatorics 3, 349–356 (1987). https://doi.org/10.1007/BF01788557

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01788557

Keywords

Search

Navigation