The complexity of counting colourings of subgraphs of the grid

Combinatorics Probability and Computing

Volumn 15, Issue 3, 2006, Pages 377-383

  Farr, G E ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY VALUE PROBLEMS; COMPUTATION THEORY; MATHEMATICAL TECHNIQUES; TREES (MATHEMATICS);

GRID; PLANAR GRAPHS; POLYNOMIAL TIME; SQUARE GRIDS; SUBGRAPHS;

GRAPH THEORY;

EID: 33645682335     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548305007364     Document Type: Article

References (20)

1. Andrzejak, A. (1998) An algorithm for the Tutte polynomials of graphs of bounded treewidth. Discrete Math. 190 39-54.
2. Baxter, R. J. (1982) Exactly Solved Models in Statistical Mechanics, Academic Press, London.
3. Biggs, N. L. (1977) Colouring square lattice graphs. Bull. London Math. Soc. 9 54-56.
4. Biggs, N. L. (1993) Algebraic Graph Theory, 2nd edition, Cambridge University Press.
5. Colbourn, C. J., Provan, J. S. and Vertigan, D. L. (1995) The complexity of computing the Tutte polynomial on transversal matroids. Combinatorica 15 1-10.
6. Di Battista, G., Eades, P., Tamassia, R. and Tollis, I. G. (1999) Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, Upper Saddle River, NJ.
7. Diestel, R. (2000) Graph Theory, 2nd edition, Springer, New York.
8. Edwards, K. J. (1986) The complexity of colouring problems on dense graphs. Theoret. Comput. Sci. 43 337-343.
9. Edwards, K. J. (1992) The complexity of some graph colouring problems. Discrete Appl. Math. 36 131-140.
10. Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of N P-Completeness, W. H. Freeman and Co., San Francisco.
11. Greenhill, C. (2000) The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Computational Complexity 9 52-73.
12. Jaeger, F., Vertigan, D. L. and Welsh, D. J. A. (1990) On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Comb. Phil. Soc. 108 35-53.
13. Linial, N. (1986) Hard enumeration problems in geometry and combinatorics. SIAM J. Alg. Disc. Meth. 1 331-335.
14. Noble, S. D. (1998) Evaluating the Tutte polynomial for graphs of bounded tree-width. Combin. Probab. Comput. 7 307-321.
15. Robertson, N. and Seymour, P. D. (1985) Graph minors: a survey. In Surveys in Combinatorics 1985; Glasgow, 1985 (I. Andersen, ed.), Vol. 103 of London Math. Soc. Lecture Notes, Cambridge University Press, Cambridge, pp. 153-171.
16. Shrock, R. (2001) Chromatic polynomials and their zeros and asymptotic limits for families of graphs. Discrete Math. 231 421-446.
17. Tamassia, R. (1987) On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16 421-444.
18. Vertigan, D. L. (1990) The computational complexity of Tutte invariants (abstract).In Kolloquium über Kombinatorik (19-23 November 1990), Zentrum für Interdisziplinäre Forschung, Universität Bielefeld, p. 124.
19. Vertigan, D. L. and Welsh, D. J. A. (1992) The computational complexity of the Tutte plane: the bipartite case. Combin. Probab. Comput. 1 181-187.
20. Welsh, D. J. A. (1993) Complexity: Knots, Colourings and Counting, Vol. 186 of London Math. Soc. Lecture Notes, Cambridge University Press.