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

Takao Asano, Takao Nishizeki, Takahiro Watanabe

Research output: Contribution to journalArticle

16 Citations (Scopus)

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 languageEnglish
Pages (from-to)315-336
Number of pages22
JournalJournal of Graph Theory
Volume4
Issue number3
DOIs
Publication statusPublished - 1980 Jan 1
Externally publishedYes

Fingerprint

Walk
Planar graph
Upper bound
Hamiltonian circuit
Connected graph
Closed
Vertex of a graph

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

An upper bound on the length of a Hamiltonian walk of a maximal planar graph. / Asano, Takao; Nishizeki, Takao; Watanabe, Takahiro.

In: Journal of Graph Theory, Vol. 4, No. 3, 01.01.1980, p. 315-336.

Research output: Contribution to journalArticle

@article{d4c43f84e9f94a1fb8d183185228a1af,
title = "An upper bound on the length of a Hamiltonian walk of a maximal planar graph",
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.",
author = "Takao Asano and Takao Nishizeki and Takahiro Watanabe",
year = "1980",
month = "1",
day = "1",
doi = "10.1002/jgt.3190040310",
language = "English",
volume = "4",
pages = "315--336",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "3",

}

TY - JOUR

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

AU - Asano, Takao

AU - Nishizeki, Takao

AU - Watanabe, Takahiro

PY - 1980/1/1

Y1 - 1980/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84986529723&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84986529723&partnerID=8YFLogxK

U2 - 10.1002/jgt.3190040310

DO - 10.1002/jgt.3190040310

M3 - Article

AN - SCOPUS:84986529723

VL - 4

SP - 315

EP - 336

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 3

ER -