Hamiltonian index is NP-complete

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F11%3A43898386" target="_blank" >RIV/49777513:23520/11:43898386 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.dam.2010.08.027" target="_blank" >http://dx.doi.org/10.1016/j.dam.2010.08.027</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2010.08.027" target="_blank" >10.1016/j.dam.2010.08.027</a>

Result language
angličtina
Original language name
Hamiltonian index is NP-complete
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)