H-colouring Pt-free graphs in subexponential time

A graph is called $P_t$-free if it does not contain the path on $t$ vertices as an induced subgraph. Let $H$ be a multigraph with the property that any two distinct vertices share at most one common neighbour. We show that the generating function for (list) graph homomorphisms from $G$ to $H$ can be calculated in subexponential time $2^{O\left(\sqrt{tn\log(n)}\right)}$ for $n=|V(G)|$ in the class of $P_t$-free graphs $G$. As a corollary, we show that the number of 3-colourings of a $P_t$-free graph $G$ can be found in subexponential time. On the other hand, no subexponential time algorithm exists for 4-colourability of $P_t$-free graphs assuming the Exponential Time Hypothesis. Along the way, we prove that $P_t$-free graphs have pathwidth that is linear in their maximum degree.

[1]  Maria Chudnovsky,et al.  Four-coloring P6-free graphs. II. Finding an excellent precoloring , 2018, ArXiv.

[2]  Patrice Ossona de Mendez,et al.  Bounded Height Trees and Tree-Depth , 2012 .

[3]  Paul S. Bonsma,et al.  The Fine Details of Fast Dynamic Programming over Tree Decompositions , 2013, IPEC.

[4]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[5]  Paul D. Seymour,et al.  Tree-chromatic number , 2016, J. Comb. Theory, Ser. B.

[6]  Oded Goldreich,et al.  Computational complexity: a conceptual perspective , 2008, SIGA.

[7]  Vadim V. Lozin,et al.  Deciding k-Colorability of P5-Free Graphs in Polynomial Time , 2007, Algorithmica.

[8]  Maya Jakobine Stein,et al.  Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices , 2018, Comb..

[9]  Maria Chudnovsky,et al.  Four-coloring Ps6-free graphs. I. Extending an excellent precoloring , 2018, ArXiv.

[10]  Vadim V. Lozin,et al.  Coloring edges and vertices of graphs without short or long cycles , 2007, Contributions Discret. Math..

[11]  Martin E. Dyer,et al.  The complexity of counting graph homomorphisms , 2000, Random Struct. Algorithms.

[12]  Maria J. Serna,et al.  The restrictive H-coloring problem , 2005, Discret. Appl. Math..

[13]  Zvi Galil,et al.  NP Completeness of Finding the Chromatic Index of Regular Graphs , 1983, J. Algorithms.

[14]  Christoph Brause.  A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs , 2017, Discret. Appl. Math..

[15]  Russell Impagliazzo,et al.  Complexity of k-SAT , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[16]  Zsolt Tuza,et al.  H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms , 2017, IPEC.

[17]  Alex D. Scott,et al.  Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function , 2006, TALG.

[18]  Shenwei Huang,et al.  Improved complexity results on k-coloring Pt-free graphs , 2013, Eur. J. Comb..

[19]  Maria Chudnovsky,et al.  Four-coloring P6-free graphs , 2019, SODA.

[20]  Jaroslav Nesetril,et al.  On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.

[21]  Zsolt Tuza,et al.  Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$Pt-Free and Broom-Free Graphs , 2018, Algorithmica.

[22]  Gregory Gutin,et al.  A dichotomy for minimum cost graph homomorphisms , 2008, Eur. J. Comb..

[23]  Zsolt Tuza,et al.  Complexity of Coloring Graphs without Forbidden Induced Subgraphs , 2001, WG.