### Abstract

A Hamiltonian walk of a connected graph is a shortest closed walk that passes through every vertex at least once, and the length of a Hamiltonian walk is the total number of edges traversed by the walk. We show that every maximal planar graph with p(≥ 3) vertices has a Hamiltonian cycle or a Hamiltonian walk of length ≤ 3(p ‐ 3)/2.

Original language | English |
---|---|

Pages (from-to) | 315-336 |

Number of pages | 22 |

Journal | Journal of Graph Theory |

Volume | 4 |

Issue number | 3 |

DOIs | |

Publication status | Published - 1980 Jan 1 |

Externally published | Yes |

### ASJC Scopus subject areas

- Geometry and Topology

## Fingerprint Dive into the research topics of 'An upper bound on the length of a Hamiltonian walk of a maximal planar graph'. Together they form a unique fingerprint.

## Cite this

Asano, T., Nishizeki, T., & Watanabe, T. (1980). An upper bound on the length of a Hamiltonian walk of a maximal planar graph.

*Journal of Graph Theory*,*4*(3), 315-336. https://doi.org/10.1002/jgt.3190040310