Skip to main content

Polyhedral decomposition of trivalent graphs

Contributed Papers

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

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   29.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   39.99
Price excludes VAT (Canada)
  • 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

References

  1. O. ORE The four-color problem (Pure and Applied Mathematics, 27. Academic Press, New York, London, 1967).

    Google Scholar 

  2. G. SZEKERES Polyhedral decompositions of cubic graphs, Bull. Austral. Math Soc. 8 (1973), 367–387.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1974 Springer-Verlag

About this paper

Cite this paper

Szekeres, G. (1974). Polyhedral decomposition of trivalent graphs. In: Holton, D.A. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057385

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06903-4

  • Online ISBN: 978-3-540-37837-2

  • eBook Packages: Springer Book Archive