This is a preview of subscription content, log in via an institution to check access.
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
G. D. Birkhoff, The reducibility of maps, Amer. J. Math. 35 (1913), 115–128.
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969.
B. Grünbaum, Polytopes, graphs and complexes, Bull. Amer. Math. Soc. 76 (1970), 1131–1201.
H. Lebesgue, Quelques conséquences simples de la formule d'Euler, J. de Math. 9 (1940), 27–43.
L. Lovász, Független köröket nem tartalmazó gráfokról, Mat. Lapok 16 (1965), 289–299.
O. Ore, The Four-Color Problem, Academic Press, New York, 1967.
H. Sachs, Construction of non-Hamiltonian planar regular graphs of degrees 3, 4, and 5 with highest possible connectivity, Theory of Graphs:, International Symposium, Rome, 1966, Gordon and Breach, New York, 1967.
P. G. Tait, Remarks on the colouring of maps, Proc. Roy. Soc. Edinburgh 10 (1880), 501–503.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1972 Springer-Verlag
About this paper
Cite this paper
Plummer, M.D. (1972). On the cyclic connectivity of planar graphs. In: Alavi, Y., Lick, D.R., White, A.T. (eds) Graph Theory and Applications. Lecture Notes in Mathematics, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067376
Download citation
DOI: https://doi.org/10.1007/BFb0067376
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06096-3
Online ISBN: 978-3-540-38114-3
eBook Packages: Springer Book Archive