Skip to main content
SpringerLink
Log in

Special embeddings of the complete graph

  • Research Papers
  • Published:
aequationes mathematicae Aims and scope Submit manuscript

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

Bibliography

  1. Ringel, G. andYoungs, J. W. T.,Solution of the Heawood Map-Coloring Problem — Case 11, J. Combinatorial Theory7, 71–93 (1969).

    Google Scholar 

  2. Youngs, J. W. T.,Minimal Imbeddings and the Genus of a Graph, J. Math. Mech.12, 303–315 (1963).

    Google Scholar 

  3. Youngs, J. W. T.,Remarks on the Heawood Conjecture (Nonorientable Case), Bull. Amer. Math. Soc.74, 347–353 (1968).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Maine, Orono, Maine, USA

    Gary Haggard

Authors
  1. Gary Haggard
    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

Haggard, G. Special embeddings of the complete graph. Aeq. Math. 8, 299–303 (1972). https://doi.org/10.1007/BF01844506

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation