An upper bound on the length of a Hamiltonian walk of a maximal planar graph

Takao Asano, Takao Nishizeki, Takahiro Watanabe

研究成果: Article

16 引用 (Scopus)

抜粋

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.

元の言語English
ページ(範囲)315-336
ページ数22
ジャーナルJournal of Graph Theory
4
発行部数3
DOI
出版物ステータスPublished - 1980 1 1
外部発表Yes

    フィンガープリント

ASJC Scopus subject areas

  • Geometry and Topology

これを引用