论文信息 - Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult

Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult

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.

[1] Vadim V. Lozin,et al. Boundary classes of graphs for the dominating set problem , 2004, Discrete Mathematics.

[2] Esther M. Arkin,et al. Two New Classes of Hamiltonian Graphs: (Extended Abstract) , 2007, Electron. Notes Discret. Math..

[3] P. Seymour,et al. The Strong Perfect Graph Theorem , 2002, math/0212070.

[4] Vadim V. Lozin. Boundary Classes of Planar Graphs , 2008, Comb. Probab. Comput..

[5] V. E. Alekseev,et al. On easy and hard hereditary classes of graphs with respect to the independent set problem , 2003, Discret. Appl. Math..

[6] Ján Plesník,et al. The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two , 1979, Inf. Process. Lett..

[7] Vadim V. Lozin,et al. NP-hard graph problems and boundary classes of graphs , 2007, Theor. Comput. Sci..

[8] Jayme Luiz Szwarcfiter,et al. Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..