Arbitrarily traceable Eulerian graph has the Hamiltonian square
Milan Sekanina; Anna Sekaninová
Archivum Mathematicum (1982)
- Volume: 018, Issue: 2, page 91-93
- ISSN: 0044-8753
Access Full Article
topHow to cite
topReferences
top- Fleischner H., The square of every nonseparable graph is Hamiltonian, Bull. Am. Math. Soc., 77 (1971), 1052-1054. (1971) Zbl0223.05124MR0284364
- Fleischner H., Hobbs A. M., A necessary condition, for the square of a graph to be Hamiltonian, J. of Comb. Theory, 19, 1975, 97-118. (1975) Zbl0315.05120MR0414433
- Hobbs A. M., Hamiltonian square of cacti, J. of Comb. Theory, Series B, 26 (1979), 50-65. (1979) MR0525816
- Karaganis J. J., On the cube a graph, Can. Math. Bull., 11 (1968), 295-296. (1968) MR0230645
- Neuman F., On a certain ordering of the vertices of a tree, Časopis pěst. mat., 89 (1964) 323-339. (1964) Zbl0131.20901MR0181587
- Ore O., A problem regarding the tracing of graphs, Elem. Math., 6 (1951), 49-53. (1951) Zbl0043.38503MR0041418
- Ore O., Theory of graphs, A. M. S., Providence, 1962. (1962) Zbl0105.35401MR0150753
- Sekanina M., On an ordering of the set of vertices of a connected graph, Publ. Fac. Sc. Univ. Brno, No 412, 1960, 137-142. (1960) Zbl0118.18903MR0140095