Skip to main content
SpringerLink
Log in

Upper and lower imbeddable graphs

  • Conference paper
  • First Online:
Graph Theory and Applications

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

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. L. Beineke and F. Harary, Inequalities involving the genus of a graph and its thickness, Proc. Glasgow Math. Assoc. 7 (1965), 19–21.

    Article  MathSciNet  MATH  Google Scholar 

  3. R. Duke, How is a graph's Betti number related to its genus? Amer. Math. Monthly 78 (1971), 386–388.

    Article  MathSciNet  MATH  Google Scholar 

  4. R. Duke, The genus regional number and Betti number of a graph, Canad. J. Math. 18 (1966), 817–822.

    Article  MathSciNet  MATH  Google Scholar 

  5. E. Nordhaus, B. Stewart, and A. White, On the maximum genus of a graph, J. Combinatorial Theory, Ser. B, 11 (1971), 258–267.

    Article  MathSciNet  MATH  Google Scholar 

  6. E. Nordhaus, R. Ringeisen, B. Stewart, and A. White, A Kuratowski type theorem for the maximum genus of a graph, J. Combinatorial Theory, to appear.

    Google Scholar 

  7. R. Ringeisen, Determining all compact orientable 2-manifolds upon which Km,n has 2-cell imbeddings, J. Combinatorial Theory, Ser. B, 12 (1972), 101–104.

    Article  MathSciNet  MATH  Google Scholar 

  8. _____, Graphs of given genus and arbitrarily large maximum genus, submitted for publication.

    Google Scholar 

  9. G. Ringel, Das Geschlecht des vollständigen paaren graphen, Abh. Math. Sem. Univ. Hamburg 28 (1965), 139–350.

    Article  MathSciNet  MATH  Google Scholar 

  10. _____ and J. W. T. Youngs, Solution of the Heawood mapcoloring problem, Nat. Acad. Sci. 60 (1968), 438–455.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Colgate University, 13346, Hamilton, NY

    Richard D. Ringeisen

Authors
  1. Richard D. Ringeisen
    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

Ringeisen, R.D. (1972). Upper and lower imbeddable 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/BFb0067378

Download citation

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

  • 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