Previous |  Up |  Next

Article

Title: Arbitrarily traceable Eulerian graph has the Hamiltonian square (English)
Author: Sekanina, Milan
Author: Sekaninová, Anna
Language: English
Journal: Archivum Mathematicum
ISSN: 0044-8753 (print)
ISSN: 1212-5059 (online)
Volume: 18
Issue: 2
Year: 1982
Pages: 91-93
.
Category: math
.
MSC: 05C45
idZBL: Zbl 0503.05042
idMR: MR683350
.
Date available: 2008-06-06T06:10:41Z
Last updated: 2012-05-09
Stable URL: http://hdl.handle.net/10338.dmlcz/107128
.
Reference: [1] Fleischner H.: The square of every nonseparable graph is Hamiltonian.Bull. Am. Math. Soc., 77 (1971), 1052-1054. Zbl 0223.05124, MR 0284364
Reference: [2] 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. Zbl 0315.05120, MR 0414433
Reference: [3] Hobbs A. M.: Hamiltonian square of cacti.J. of Comb. Theory, Series B, 26 (1979), 50-65. MR 0525816
Reference: [4] Karaganis J. J.: On the cube a graph.Can. Math. Bull., 11 (1968), 295-296. MR 0230645
Reference: [5] Neuman F.: On a certain ordering of the vertices of a tree.Časopis pěst. mat., 89 (1964) 323-339. Zbl 0131.20901, MR 0181587
Reference: [6] Ore O.: A problem regarding the tracing of graphs.Elem. Math., 6 (1951), 49-53. Zbl 0043.38503, MR 0041418
Reference: [7] Ore O.: Theory of graphs.A. M. S., Providence, 1962. Zbl 0105.35401, MR 0150753
Reference: [8] Sekanina M.: On an ordering of the set of vertices of a connected graph.Publ. Fac. Sc. Univ. Brno, No 412, 1960, 137-142. Zbl 0118.18903, MR 0140095
.

Files

Files Size Format View
ArchMath_018-1982-2_5.pdf 394.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo