Faulkner, G. B.; Younger, D. H. Non-Hamiltonian cubic planar maps. (English) Zbl 0271.05106 Discrete Math. 7, 67-74 (1974). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 24 Documents MSC: 05C10 Planar graphs; geometric and topological aspects of graph theory 05C35 Extremal problems in graph theory PDFBibTeX XMLCite \textit{G. B. Faulkner} and \textit{D. H. Younger}, Discrete Math. 7, 67--74 (1974; Zbl 0271.05106) Full Text: DOI References: [1] J. Butler, Hamiltonian circuits on simple 3-poly topes, J. Combin. Theory (series B), to appear.; J. Butler, Hamiltonian circuits on simple 3-poly topes, J. Combin. Theory (series B), to appear. [2] Faulkner, G. B., Recursive generation of cyclically \(k\)-connected cubic planar graphs, Ph.D. Thesis (1971), University of Waterloo: University of Waterloo Budapest · Zbl 0327.05114 [3] Grinberg, E., Plane homogeneous graphs of degree three without Hamiltonian circuits, Latvian Math. Yearbook, Izdat. “Zinatne”, Riga, 4, 51-58 (1968), (in Russian) · Zbl 0185.27901 [4] Grünbaum, B., Polytopes, graphs, and complexes, Bull. Am. Math. Soc., 76, 1143-1145 (1970) · Zbl 0211.25001 [5] Hunter, H. F., On non-Hamiltonian maps and their duals, (Ph.D. Thesis (1962), Rensselaer Polytechnic Institute) [6] Kotzig, A., Regularly connected trivalent graphs without non-trivial cuts of cardinality 3, Acta Fac. Rerum Natur. Univ. Comenian. Math., 21, 1-14 (1968), (1969) · Zbl 0199.27301 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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.