Skip to main content
SpringerLink
Log in

Non-existence of graph embeddings

  • Conference paper
  • First Online:
Theory and Applications of Graphs

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 642))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Battle, J., Harary, F., Kodama, Y., Youngs, J.W.T., Additivity of the genus of a graph. Byll. Amer. Math. Soc. 68, 565–568 (1962).

    Article  MathSciNet  MATH  Google Scholar 

  2. Duke, R.A., and Haggard, G., The genus of subgraphs of K8, Israel J. of Math., Vol. 11, No. 4, 1972, pp 452–455.

    Article  MathSciNet  MATH  Google Scholar 

  3. Franklin, P., A Six Colour Problem, J. Math. Phys. 13, 363–369 (1934).

    Google Scholar 

  4. Gross, J. and Alpert, S., The topological theory of current graphs, to appear.

    Google Scholar 

  5. Heawood, P.J., Map Colour Theorem, Quart, J. Math. 24, 332–338 (1890).

    Google Scholar 

  6. Huneke, J.P., A Minimum Vertex Triangulation. Submitted to J. Combinatorial Theory.

    Google Scholar 

  7. Jungerman, M., Orientable Triangular Embeddings of K18-K3 and K13-K3, J. Combinatorial Theory, Series B, Vol. 16, 293–294 (1974).

    Article  MathSciNet  MATH  Google Scholar 

  8. Jungerman, M., A New Solution for the Nonorientable Case 1 of the Heawood Map Color Theorem, J. Combinatorial Theory, Vol. 19, 69–71 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  9. Jungerman, M., The Genus of the Symmetric Quadripartite Graph. J. Combinatorial Theory, Series B, Vol. 19, 181–197 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  10. Jungerman, M., The Non-Orientable Genus of the Symmetric Quadripartite Graph, Submitted to the J. Combinatorial Theory, Series B, 1976.

    Google Scholar 

  11. Ringel, G., Farbensatz für nichtorientierbare Flächen beliebigen Geschlechts. Journal fur die reine und angewandte Mathematik, Band 190, Seite 129–147 (1952).

    MathSciNet  MATH  Google Scholar 

  12. Ringel, G., Wie man die geschlossenen nichtorientierbaren Flachen in moglichst wenig Dreiecke zerlegen kann, Math. Annalen, Bd. 130, S. 317–326 (1955).

    Article  MathSciNet  MATH  Google Scholar 

  13. Ringel, G., Map Color Theorem, Springer-Verlag, Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen Band 209, 1974.

    Google Scholar 

  14. Skupien, Z., Locally Hamiltonian and Planar Graphs, Fundamenta Mathematica, Vol. 58, (193–200) 1966.

    MathSciNet  MATH  Google Scholar 

  15. Stahl, S., Self-dual Embeddings of Graphs, Doctoral dissertation, Western Michigan University, August 1975.

    Google Scholar 

  16. Tutte, W.T., A family of cubical graphs, Proc. Cambridge Philos. Soc. 43, 459–474 (1947).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California, Santa Cruz, Santa Cruz, California, USA

    Gerhard Ringel

Authors
  1. Gerhard Ringel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Western Michigan University, Kalamazoo, MI, 49008, USA

    Yousef Alavi  & Don R. Lick  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ringel, G. (1978). Non-existence of graph embeddings. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070403

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08666-6

  • Online ISBN: 978-3-540-35912-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation