Hamiltonian cycles in subcubic graphs: what makes the problem difficult

Authors:
Nicholas Korpelainen;Vadim V. Lozin;Alexander Tiskin
Affiliations:
,DIMAP, University of Warwick, Coventry, UK;,DIMAP, University of Warwick, Coventry, UK;,DIMAP, University of Warwick, Coventry, UK
Venue:
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Year:
2010

Citing 4
Cited 1

On easy and hard hereditary classes of graphs with respect to the independent set problem

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
NP-hard graph problems and boundary classes of graphs

Theoretical Computer Science
Boundary classes of planar graphs

Combinatorics, Probability and Computing
The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound two

Information Processing Letters

Boundary properties of graphs for algorithmic graph problems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the computational complexity of the hamiltonian cycle problem in the class of graphs of vertex degree at most 3 Our goal is to distinguish boundary properties of graphs that make the problem difficult (NP-complete) in this domain In the present paper, we discover the first boundary class of graphs for the hamiltonian cycle problem in subcubic graphs.