An upper bound on the length of a Hamiltonian walk of a maximal planar graph
- 1 September 1980
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 4 (3) , 315-336
- https://doi.org/10.1002/jgt.3190040310
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On Hamiltonian Walks in GraphsSIAM Journal on Computing, 1974
- Shortness exponents of families of graphsJournal of Combinatorial Theory, Series A, 1973
- Hamiltonian circuits on 3-polytopesJournal of Combinatorial Theory, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Simple paths on polyhedraPacific Journal of Mathematics, 1963
- A Theorem on GraphsAnnals of Mathematics, 1931