Parameterized Edge Hamiltonicity

Abstract We study the parameterized complexity of the classical Edge Hamiltonian Path  problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. (2014) by showing that Edge Hamiltonian Path  is FPT parameterized by vertex cover, and that it also admits a cubic kernel. We then show fixed-parameter tractability even for a generalization of the problem to arbitrary hypergraphs, parameterized by the size of a (supplied) hitting set. As an interesting consequence, we show that this implies an FPT algorithm for (Vertex) Hamiltonian Path parameterized by (vertex) clique cover. We also consider the problem parameterized by treewidth or clique-width. Surprisingly, we show that the problem is FPT for both of these standard parameters, in contrast to its vertex version, which is W[1]-hard for clique-width. Our technique, which may be of independent interest, relies on a structural characterization of clique-width in terms of treewidth and complete bipartite subgraphs due to Gurski and Wanke.

[1]  Paul A. Catlin,et al.  Supereulerian graphs: A survey , 1992, J. Graph Theory.

[2]  Egon Wanke,et al.  How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time , 2001, WG.

[3]  Gary Chartrand.  ON HAMILTONIAN LINE-GRAPHS(') , 1968 .

[4]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[5]  Paul D. Seymour,et al.  Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.

[6]  Petr A. Golovach,et al.  Clique-width: on the price of generality , 2009, SODA.

[7]  Ten-Hwang Lai,et al.  The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs , 1993, Inf. Process. Lett..

[8]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[9]  Alan A. Bertossi,et al.  The Edge Hamiltonian Path Problem is NP-Complete , 1981, Inf. Process. Lett..

[10]  Michal Pilipczuk,et al.  Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[11]  Neeldhara Misra,et al.  UNO Gets Easier for a Single Player , 2014, FUN.

[12]  Erik D. Demaine,et al.  UNO is hard, even for a single player , 2010, Theoretical Computer Science.

[13]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[14]  Hong-Jian Lai,et al.  Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs , 2003 .

[15]  Richard A. Brualdi,et al.  Hamiltonian line graphs , 1981, J. Graph Theory.

[16]  Édouard Bonnet,et al.  The Graph Motif Problem Parameterized by the Structure of the Input Graph , 2015, IPEC.

[17]  Lane H. Clark.  On hamiltonian line graphs , 1984, J. Graph Theory.

[18]  Udi Rotics,et al.  On the Relationship Between Clique-Width and Treewidth , 2001, SIAM J. Comput..

[19]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[20]  Georg Gottlob,et al.  Width Parameters Beyond Tree-width and their Applications , 2008, Comput. J..

[21]  Justyna Petke,et al.  Cliquewidth and Knowledge Compilation , 2013, SAT.

[22]  Jeanette P. Schmidt,et al.  The Spatial Complexity of Oblivious k-Probe Hash Functions , 2018, SIAM J. Comput..

[23]  Egon Wanke,et al.  The Tree-Width of Clique-Width Bounded Graphs Without Kn, n , 2000, WG.

[24]  F. Harary,et al.  On Eulerian and Hamiltonian Graphs and Line Graphs , 1965, Canadian Mathematical Bulletin.

[25]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.

[26]  Gerhard J. Woeginger,et al.  Hamiltonian index is NP-complete , 2011, Discret. Appl. Math..

[27]  Egon Wanke,et al.  Line graphs of bounded clique-width , 2007, Discret. Math..

[28]  Hong-Jian Lai.  Eulerian subgraphs containing given vertices and hamiltonian line graphs , 1998, Discret. Math..

[29]  M. P. J. Bart,et al.  Parameter ecology for Feedback Vertex Set , 2014 .

[30]  Arie M. C. A. Koster,et al.  Combinatorial Optimization on Graphs of Bounded Treewidth , 2008, Comput. J..

[31]  Noga Alon,et al.  Color-coding , 1995, JACM.