The complexity of counting graph homomorphisms

Random Structures and Algorithms

Volumn 17, Issue 3-4, 2000, Pages 260-289

  Dyer, Martin ^a   Greenhill, Catherine ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034369431     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-2418(200010/12)17:3/4<260::aid-rsa5>3.0.co;2-w     Document Type: Article

References (25)

1. M. Albertson, P. Catlin, and L. Gibbons, Homomorphisms of 3-chromatic graphs, II, Congressus Numerantium 47 (1985), 19-28.
2. G. Bloom and S. Burr, On unavoidable digraphs in orientations of graphs, J Graph Theory 11 (1987), 453-462.
3. G. R. Brightwell and P. Winkler, Graph homomorphisms and phase transitions, J Combin Theory Ser B 77 (1999), 221-262.
4. R. Bubley, M. Dyer, C. Greenhill, and M. Jerrum, On approximately counting colourings of small degree graphs, SIAM J Comput 29 (1999), 387-400.
5. R. Burton and J. Steif, Nonuniqueness of measures of maximal entropy for subshifts of finite type, Ergodic Theory Dynam Syst, 14, 213-236.
6. P. A. Dreyer, C. Malon, and J. Nešetřil, Universal H-colorable graphs without a given configuration, preprint.
7. M. Dyer and C. Greenhill, On Markov chains for independent sets, J Alg 35 (2000), 17-49.
8. H. M. Edwards, Galois theory, Springer-Verlag, New York, 1984.
9. A. Galluccio, P. Hell, and J. Nešetřil, The complexity of H-coloring of bounded degree graphs, Discrete Math, to appear.
10. C. Greenhill, The complexity of counting colourings and independent sets in sparse graphs and hypergraphs, Computat Complexity, to appear.
11. P. Hell and J. Nešetřil, On the complexity of H-coloring, J Combin Theory Ser B 48 (1990), 92-110.
12. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, and R.E. Stearns, The complexity of planar counting problems, SIAM J Comput 27 (1998), 1142-1167.
13. R. W. Irving, NP-completeness of a family of graph-colouring problems, Discrete Appl Math 5 (1983), 111-117.
14. F. Jaeger, D. L. Vertigan, and D. Welsh, On the computational complexity of the Jones and Tutte polynomials, Math Proc Cambridge Philos Soc 108 (1990), 35-53.
15. J. Kahn, An entropy approach to the hard-core model on bipartite graphs, preprint.
16. J. L. Lebowitz and G. Gallavotti, Phase transitions in binary lattice gases, J Math Phys 12 (1971), 1129-1133.
17. A. K. Lenstra, H. W. Lenstra, Jr., and L. Loväsz, Factoring polynomials with rational coefficients, Math Annalen 261 (1982), 515-534.
18. L. A. Levin, Universal sequential search problems, Probl Inform Transmission 9 (1973), 265-266.
19. N. Linial, Hard enumeration problems in geometry and combinatorics, SIAM J Alg Discrete Methods 7 (1986), 331-335.
20. M. Luby and E. Vigoda, Approximately counting up to four, Proc 29th Annual Symposium on Theory of Computing, ACM, New York, 1997, pp. 682-687.
21. H. A. Maurier, J. H. Sudborough, and E. Welzl, On the complexity of the general colouring problem, Inform Control 51 (1981), 123-145.
22. S. P. Vadhan, The complexity of counting in sparse, regular, and planar graphs, preprint (Available from http://www.toc.lcs.mit.edu/~salil/).
23. L. G. Valiant, The complexity of enumeration and reliability problems, SIAM J Comput 8 (1979), 410-421.
24. D. J. A. Welsh, Complexity: knots, colourings and counting, vol. 186 of London Mathematical Society Lecture Note Series, Cambridge University Press, Cambridge, 1993.
25. B. Widom and J. S. Rowlinson, New model for the study of liquid-vapour phase transition, J Chem Phys 52 (1970), 1670-1684.