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. Chartrand and F. Harary, Theory of Graphs (P. Erdös and G. Katona, eds.) Akadémiai Kiadó, Budapest, 1968, 61–63.
G. Chartrand, S.F. Kapoor, and H.V. Kronk, A sufficient condition for n-connectedness of graphs, Mathematika, 15 (1968), 51–52.
G. Chartrand, S.F. Kapoor, and H.V. Kronk, A generalization of hamiltonian-connected graphs, to appear.
G. Chartrand, S.F. Kapoor, and D.R. Lick, n-hamiltonian graphs, J. Combinatorial Theory, to appear.
G. Chartrand and H.V. Kronk, Randomly traceable graphs, J. SIAM Appl. Math., 16 (1968), 696–700.
G.A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc., 2 (1952), 69–81.
H.V. Kronk, Generalization of a theorem of Pósa, Proc. Amer. Math. Soc., to appear.
O. Ore, Note on hamilton circuits, Amer. Math. Monthly, 65 (1958), 611.
O. Ore, Arc coverings of graphs, Ann. Mat. Pura Appl., 55 (1961), 315–322.
L. Pósa, A theorem concerning hamilton lines, Magyar Tud. Akad. Mat. Kutató Int. Közl. 7 (1962), 225–226.
L. Pósa, On the circuits of finite graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl., 8 (1963), 355–361.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1969 Springer-Verlag
About this paper
Cite this paper
Kronk, H.V. (1969). Variations on a theorem of Pósa. In: Chartrand, G., Kapoor, S.F. (eds) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060117
Download citation
DOI: https://doi.org/10.1007/BFb0060117
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04629-5
Online ISBN: 978-3-540-36161-9
eBook Packages: Springer Book Archive