Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10328289 | Discrete Applied Mathematics | 2011 | 5 Pages |
Abstract
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less than or equal to a given constant is NP-complete (although this was conjectured to be polynomial). Consequently, the corresponding problem to determine the hamiltonian index of a given graph is NP-hard. Finally, we show that some known upper and lower bounds on the hamiltonian index can be computed in polynomial time.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
ZdenÄk RyjáÄek, Gerhard J. Woeginger, Liming Xiong,