Skip to main content
SpringerLink
Log in
Book cover

Graph Theory and Applications pp 269–281Cite as

Triangular embeddings of graphs

  • Conference paper
  • First Online:

  • 1024 Accesses

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

This is a preview of subscription content, 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   34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Gustin, Orientable embedding of Cayley graphs, Bull. Amer. Math. Soc. 69 (1963), 272–275.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. Edmonds, A combinatorial representation for polyhedral surfaces, Notices Amer. Math. Soc. 7 (1960), 646.

    Google Scholar 

  3. G. Ringel, Färbungsprobleme auf Flächen und Graphen, VEB Deutscher der Wissenschaften, Berlin, 1959.

    MATH  Google Scholar 

  4. G. Ringel, Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann, Math. Ann. 130 (1955), 317–326.

    Article  MathSciNet  MATH  Google Scholar 

  5. G. Ringel and J. W. T. Youngs, Solution of the Heawood map-coloring problem, Proc. Nat. Acad. Sci. USA 60 (1968), 438–445.

    Article  MathSciNet  MATH  Google Scholar 

  6. __________, Solution of the Heawood map-coloring problem, Case 11, J. Combinatorial Theory 7 (1969), 71–93.

    Article  MathSciNet  MATH  Google Scholar 

  7. J. W. T. Youngs, Minimal imbeddings and the genus of a graph, J. Math. Mech. 12 (1963), 303–315.

    MathSciNet  MATH  Google Scholar 

  8. _____, Solution of the map-coloring problem — Cases 1, 7, and 10. J. Combinatorial Theory 9 (1970), 220–231.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California, 95060, Santa Cruz, CA

    Gerhard Ringel

Authors
  1. Gerhard Ringel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Y. Alavi D. R. Lick A. T. White

Rights and permissions

Reprints and permissions

Copyright information

© 1972 Springer-Verlag

About this paper

Cite this paper

Ringel, G. (1972). Triangular embeddings of graphs. In: Alavi, Y., Lick, D.R., White, A.T. (eds) Graph Theory and Applications. Lecture Notes in Mathematics, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067379

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06096-3

  • Online ISBN: 978-3-540-38114-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation