The square of every nonseparable graph is Hamiltonian
HTML articles powered by AMS MathViewer
- by Herbert Fleischner PDF
- Bull. Amer. Math. Soc. 77 (1971), 1052-1054
References
-
1. M. Sekanina, Problem No. 28, Theory of Graphs and its Applications, Academic Press, New York, 1964.
2. C. St. J. A. Nash-Williams, Problem No. 48, Theory of Graphs, Academic Press, New York, 1968.
- H. V. Kronk, Research Problems: Is the Square of Every Nonseparable Graph Hamiltonian?, Amer. Math. Monthly 76 (1969), no. 9, 1045–1046. MR 1535643, DOI 10.2307/2317138
Additional Information
- Journal: Bull. Amer. Math. Soc. 77 (1971), 1052-1054
- MSC (1970): Primary 05C99
- DOI: https://doi.org/10.1090/S0002-9904-1971-12860-4
- MathSciNet review: 0284364