Skip to main content

On Cubic Graphs of Girth at Least Five

  • Chapter
The Mathematics of Paul Erdös I

Part of the book series: Algorithms and Combinatorics ((AC,volume 13))

  • 946 Accesses

Abstract

It is an honor to be asked to contribute a paper to so historically important a collection. Yet it can be embarrassing too. In my case I ask distractedly “What can I write about? The researches I have completed have been published already, or at least have been submitted to Journals. The work I am engaged upon is incomplete, may be anticipated, perhaps even fallacious. And what else can there be?”

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Tutte, W.T. (1997). On Cubic Graphs of Girth at Least Five. In: Graham, R.L., Nešetřil, J. (eds) The Mathematics of Paul Erdös I. Algorithms and Combinatorics, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60408-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60408-9_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-64394-1

  • Online ISBN: 978-3-642-60408-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics