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.
Similar content being viewed by others
References
Hartsfield, N. Jackson, B. Ringel, G.: The splitting number of the complete graph. Graphs and Combinatorics1, 311–329 (1985)
Jackson, B. Ringel, G.: Maps ofm-pires on the projective plane. Discrete Math.46, 15–20 (1983)
Ringel, G.: Map Color Theorem. New York: Springer-Verlag 1974
Author information
Authors and Affiliations
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788557