Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bondy, J.A. and Murty, U.S.R., Graph Theory with Applications, (Macmillan, London, 1976).
Ellingham, M.N., Nonhamiltonian 3-connected cubic bipartite graphs, University of Melbourne Research Report No. 28, 1981.
Faradzev, I.A., Constructive enumeration of combinatorial objects, Problèmes combinatories et théorie des graphes, Colloque International CNRS, Université d'Orsay, July 1976, Colloques Internationaux du Centre National de la Recherche Scientifique 260, 131–135.
Holton, D.A., McKay, B.D., Plummer, M.D. and Thomassen, C., A nine point theorem for 3-connected cubic graphs, University of Melbourne Research Report No. 3, 1981.
McKay, B.D., Practical graph isomorphism, Vanderbilt University Computer Science Research Report CS-81-01, 1981.
Ore, O., The Four Color Problem (Academic Press, New York, 1967).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag
About this paper
Cite this paper
Ellingham, M.N. (1982). Constructing certain cubic graphs. In: Billington, E.J., Oates-Williams, S., Street, A.P. (eds) Combinatorial Mathematics IX. Lecture Notes in Mathematics, vol 952. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0061983
Download citation
DOI: https://doi.org/10.1007/BFb0061983
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11601-1
Online ISBN: 978-3-540-39375-7
eBook Packages: Springer Book Archive