An upper bound on the length of a Hamiltonian walk of a maximal planar graph. (English) Zbl 0433.05037


05C35 Extremal problems in graph theory
05C38 Paths and cycles
05C10 Planar graphs; geometric and topological aspects of graph theory
05C45 Eulerian and Hamiltonian graphs


Zbl 0413.05023
Full Text: DOI


[1] Barnette, J. Combinatorial Theory 2 pp 54– (1970) · Zbl 0197.49904
[2] On Hamiltonian walks. In Proceedings of the 5th British Combinatorial Conference, Aberdeen (1975) 41–51.
[3] Goodman, SIAM J. Comput. 3 pp 214– (1974)
[4] Grünbaum, J. Combinatorial Theory Ser. A 6 pp 364– (1973)
[5] Graph Theory. Addison-Wesley, Reading, Mass. (1969).
[6] Hamiltonian pseudo cycles in graphs. Proceedings 5th Southeastern Conference Combinatorics, Graph Theory and Computing, Boca Raton (1975) 529–533.
[7] Moon, Pacific J. Math. 13 pp 629– (1963) · Zbl 0115.41001
[8] Whitney, Annals Math. 32 pp 378– (1931)
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.