Zamfirescu, Tudor Three small cubic graphs with interesting Hamiltonian properties. (English) Zbl 0442.05047 J. Graph Theory 4, 287-292 (1980). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 Documents MSC: 05C45 Eulerian and Hamiltonian graphs 05C35 Extremal problems in graph theory Keywords:non-traceable; cubic 3-connected planar graph; not homogeneously traceable; cubic one-Hamiltonian graph; not Hamiltonian-connected PDF BibTeX XML Cite \textit{T. Zamfirescu}, J. Graph Theory 4, 287--292 (1980; Zbl 0442.05047) Full Text: DOI OpenURL References: [1] Hamiltonian graphs. In Selected Topics in Graph Theory. Edited by and . Academic, London (1978) 127–167. [2] Hamiltonian lines in cubic graphs. International Seminar on Graph Theory and its Applications, Rome, July 5–9 (1966). [3] Hamiltonian paths on convex polyhedra. RAND Corp., Note P-2069 (1960). [4] Chartrand, Ann. N.Y. Acad. Sci. 319 pp 130– (1979) [5] Convex Polytopes. Wiley-Interscience, London (1967). · Zbl 0163.16603 [6] Grünbaum, Bull. Amer. Math. Soc. 76 pp 1131– (1970) [7] Grünbaum, J. London Math. Soc. 37 pp 152– (1962) [8] , and , Recherche systematique des graphes hypohamiltoniens. Theorie des Graphes. Edited by Dunod, Paris (1967) 153–159. · Zbl 0196.56102 [9] Systematics of organic molecules, graph topology and Hamilton circuits. Stanford Univ. Instr. Res. Lab. Rept. No. 1040, (1966). [10] Homogeneously traceable and Hamiltonian connected graphs (unpublished). · Zbl 0585.05020 [11] Tutte, J. London Math. Soc. 21 pp 98– (1946) This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.