×

zbMATH — the first resource for mathematics

Planar and infinite hypohamiltonian and hypotraceable graphs. (English) Zbl 0322.05130

MSC:
05C35 Extremal problems in graph theory
05C10 Planar graphs; geometric and topological aspects of graph theory
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Chvátal, V., Flip-flops in Hypohamiltonian graphs, Can. math. bull., 16, 33-41, (1973) · Zbl 0253.05142
[2] Chvátal, V., New directions in Hamiltonian graph theory, () · Zbl 0271.05120
[3] Chvátal, V.; Klarner, D.A.; Knuth, D.E., Selected combinatorial research problems, (1972), Stanford University Stanford, Problem 19.
[4] Doyen, J.; Van Diest, V., New families of Hypohamiltonian graphs, Discrete math., 13, 225-236, (1975) · Zbl 0312.05114
[5] Faulkner, G.B.; Younger, D.H., Non-Hamiltonian cubic planar maps, Discrete math., 7, 67-74, (1974) · Zbl 0271.05106
[6] Grinberg, E., Plane homogeneous graphs of degree three without Hamiltonian circuits, Latvian math. yearbook, izdal. “zinatne”, 4, 51-58, (1968), (in Russian) · Zbl 0185.27901
[7] Grünbaum, B., Polytopes, graphs and complexes, Bull. am. math. soc., 76, 1131-1201, (1970) · Zbl 0211.25001
[8] Grünbaum, B., Vertices missed by longest paths or circuits, J. combin. theory, 17, 31-38, (1974) · Zbl 0259.05120
[9] Guy, R., Monthly research problems, 1969-1973, Am. math. monthly, 80, 1120-1128, (1973)
[10] Harary, F., Graph theory, (1969), Addison-Wesley Reading, Mass · Zbl 0797.05064
[11] Herz, J.C.; Duby, J.J.; Vigué, F., Recherche systématique des graphes Hypohamiltonian, (), 153-160 · Zbl 0196.56102
[12] Honsberger, R., Mathematical gems, (1973), Math. Assoc. of America, Chapter 7 · Zbl 0281.00004
[13] Thomassen, C., Hypohamiltonian and hypotraceable graphs, Discrete math., 9, 91-96, (1974) · Zbl 0278.05110
[14] Thomassen, C., On Hypohamiltonian graphs, Discrete math., 10, 383-390, (1974) · Zbl 0286.05122
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.