Skip to main content

Classifying K-connected cubic graphs

Contributed Papers

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

Abstract

This paper examines simple operations by which the cubic graphs with a given connectedness on p points can be constructed from those on less than p points. In particular, for cyclically 4-connected cubic graphs, the only operation required is that of joining the midpoints of two non-adjacent lines.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.M. Brink and D.R. Satchler, Angular Momentum. 2nd edn (Oxford University Press, London, 1968.)

    MATH  Google Scholar 

  2. B. Grünbaum, Convex Polytopes. (John Wiley & Sons, London, 1967.)

    MATH  Google Scholar 

  3. F. Harary, Graph Theory. (Addison-Wesley, Reading, Mass., 1969.)

    MATH  Google Scholar 

  4. P.J. Slater, A classification of 4-connected graphs, J. Combinatorial Theory 17B (1974), 281–298.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. P.J. Slater, General soldering, Proceedings of the Fifth British Combinatorial Conference (C.St.J.A. Nash-Williams and J. Sheehan, eds) Utilitas Math., Winnipeg; 1976, 559–567.

    Google Scholar 

  6. W.T. Tutte, Connectivity in Graphs. (Toronto University Press, Toronto, 1967.)

    MATH  Google Scholar 

  7. N. Wormald, Enumeration of labelled graphs I: 3-connected graphs, J. London Math. Soc. (to appear).

    Google Scholar 

  8. N.C. Wormald, The asymptotic connectivity of labelled regular graphs, (to appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1979 Springer-Verlag

About this paper

Cite this paper

Wormald, N.C. (1979). Classifying K-connected cubic graphs. In: Horadam, A.F., Wallis, W.D. (eds) Combinatorial Mathematics VI. Lecture Notes in Mathematics, vol 748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0102696

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09555-2

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

  • eBook Packages: Springer Book Archive