The Complexity of Counting Colourings of Subgraphs of the Grid

It is well known that counting $\lambda$-colourings ($\lambda\geq 3$) is nP-complete for general graphs, and also for several restricted classes such as bipartite planar graphs. On the other hand, it is known to be polynomial time computable for graphs of bounded tree-width. There is often special interest in counting colourings of square grids, and such graphs can be regarded as borderline graphs of unbounded tree-width in a specific sense. We are thus motivated to consider the complexity of counting colourings of subgraphs of the square grid. We show that the problem is nP-complete when $\lambda\geq 3$. It remains nP-complete when restricted to induced subgraphs with maximum degree 3.

[1]  Keith Edwards,et al.  The complexity of some graph colouring problems , 1992, Discrete Applied Mathematics.

[2]  Norman Biggs,et al.  Colouring Square Lattice Graphs , 1977 .

[3]  Artur Andrzejak,et al.  An algorithm for the Tutte polynomials of graphs of bounded treewidth , 1998, Discret. Math..

[4]  Charles J. Colbourn,et al.  The complexity of computing the tutte polynomial on transversal matroids , 1995, Comb..

[5]  P. Seymour,et al.  Surveys in combinatorics 1985: Graph minors – a survey , 1985 .

[6]  D. Welsh.  Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .

[7]  R. Baxter.  Exactly solved models in statistical mechanics , 1982 .

[8]  Robert Shrock.  Chromatic polynomials and their zeros and asymptotic limits for families of graphs , 2001, Discret. Math..

[9]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[10]  Catherine S. Greenhill.  The complexity of counting colourings and independent sets in sparse graphs and hypergraphs , 2000, computational complexity.

[11]  N. Linial.  Hard enumeration problems in geometry and combinatorics , 1986 .

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Steven D. Noble,et al.  Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width , 1998, Combinatorics, Probability and Computing.

[14]  Dominic J. A. Welsh,et al.  The Computational Complexity of the Tutte Plane: the Bipartite Case , 1992, Combinatorics, Probability and Computing.

[15]  Keith Edwards,et al.  The Complexity of Colouring Problems on Dense Graphs , 1986, Theor. Comput. Sci..

[16]  D. Welsh,et al.  On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.