A sufficient condition for $k$-path Hamiltonian digraphs
HTML articles powered by AMS MathViewer
- by John Roberts PDF
- Bull. Amer. Math. Soc. 82 (1976), 63-65
References
- S. F. Kapoor and K. K. Theckedath, Highly traceable graphs, Sankhyā Ser. A 33 (1971), 211–216. MR 314702
- Hudson V. Kronk, A note on $k$-path Hamiltonian graphs, J. Combinatorial Theory 7 (1969), 104–106. MR 245464, DOI 10.1016/S0021-9800(69)80043-8
- Oystein Ore, Note on Hamilton circuits, Amer. Math. Monthly 67 (1960), 55. MR 118683, DOI 10.2307/2308928
- Oystein Ore, Hamilton connected graphs, J. Math. Pures Appl. (9) 42 (1963), 21–27. MR 146816
- D. R. Woodall, Sufficient conditions for circuits in graphs, Proc. London Math. Soc. (3) 24 (1972), 739–755. MR 318000, DOI 10.1112/plms/s3-24.4.739
Additional Information
- Journal: Bull. Amer. Math. Soc. 82 (1976), 63-65
- MSC (1970): Primary 05C20
- DOI: https://doi.org/10.1090/S0002-9904-1976-13955-9
- MathSciNet review: 0396332