Powers of Hamiltonian Paths in Interval Graphs (1998)
by
Garth Isaak
| Venue: | J. Graph Theory |
| Citations: | 2 - 1 self |
BibTeX
@ARTICLE{Isaak98powersof,
author = {Garth Isaak},
title = {Powers of Hamiltonian Paths in Interval Graphs},
journal = {J. Graph Theory},
year = {1998},
volume = {27},
pages = {31--38}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract: We give a simple proof that the obvious necessary conditions for a graph to contain the k th power of a Hamiltonian path are sufficient for the class of interval graphs. The proof is based on showing that a greedy algorithm tests for the existence of Hamiltonian path powers in interval graphs. We will also discuss covers by powers of paths and analogues of the Hamiltonian completion number.
