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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G.M. Brink and D.R. Satchler, Angular Momentum. 2nd edn (Oxford University Press, London, 1968.)
B. Grünbaum, Convex Polytopes. (John Wiley & Sons, London, 1967.)
F. Harary, Graph Theory. (Addison-Wesley, Reading, Mass., 1969.)
P.J. Slater, A classification of 4-connected graphs, J. Combinatorial Theory 17B (1974), 281–298.
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.
W.T. Tutte, Connectivity in Graphs. (Toronto University Press, Toronto, 1967.)
N. Wormald, Enumeration of labelled graphs I: 3-connected graphs, J. London Math. Soc. (to appear).
N.C. Wormald, The asymptotic connectivity of labelled regular graphs, (to appear).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
