Powers of Hamiltonian paths in interval graphs
نویسنده
چکیده
We give a simple proof that the obvious necessary conditions for a graph to contain the kth 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. c © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 31–38, 1998
منابع مشابه
Hamiltonian powers in threshold and arborescent comparability graphs
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give efficient algorithms as well as sufficient and minimax toughness like conditions. For arborescent comparability graphs we have similar results but also show that for one type of completion problem an ‘obvious’ minimax condi...
متن کاملProper interval graphs and the guard problem
This paper is a study of the hamiltonicity of proper interval graphs with applications to the guard problem in spiral polygons. We prove that proper interval graphs with ~> 2 vertices have hamiltonian paths, those with ~>3 vertices have hamiltonian cycles, and those with />4 vertices are hamiltonian-connected if and only if they are, respectively, 1-, 2-, or 3-connected. We also study the guard...
متن کاملGeometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملHamiltonian Paths in Cartesian Powers of Directed Cycles
The vertex set of the k cartesian power of a directed cycle of length m can be naturally identified with the abelian group (Zm) . For any two elements v = (v1, . . . , vk) and w = (w1, . . . , wk) of (Zm) , it is easy to see that if there is a hamiltonian path from v to w, then v1 + · · ·+ vk ≡ w1 + · · ·+ wk + 1 (mod m). We prove the converse, unless k = 2 and m is odd.
متن کاملPowers of cycles, powers of paths, and distance graphs
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations for both powers of cycles and powers of paths. The characterizations lead to linear-time recognition algorithms of these classes of graphs. Furthermore, as a generalization of powers of cycles, powers of paths, and ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 28 شماره
صفحات -
تاریخ انتشار 1998