Chromatic, flow and reliability polynomials: The complexity of their coefficients

Combinatorics Probability and Computing

Volumn 11, Issue 4, 2002, Pages 403-426

  Oxley, James ^a   Welsh, Dominic ^b  

^a LOUISIANA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DECISION THEORY; GRAPH THEORY; MATRIX ALGEBRA; SET THEORY; THEOREM PROVING; VECTORS;

CHROMATIC POLYNOMIALS; FLOW POLYNOMIALS; RELIABILITY POLYNOMIALS; ROBERTSON-SEYMOUR THEORY; TUTTE POLYNOMIALS;

POLYNOMIALS;

EID: 0035993125     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548302005175     Document Type: Article

References (41)

1. Alon, N., Friese, A. M. and Welsh, D. J. A. (1995) Polynomial time randomized approximation schemes for Tutte-Grothendieck invariants: The dense case, Random Struct. Alg. 6 459-478.
2. Andrzejak, A. (1998) An algorithm for the Tutte polynomials of graphs of bounded treewidth. Discrete Math. 190 39-54.
3. Annan, J. D. (1994) DPhil thesis, University of Oxford.
4. Annan, J. D. (1995) The complexities of the coefficients of the Tutte polynomial. Discrete Appl. Math. 57 93-103.
5. Bixby, R. E. and Cunningham, W. H. (1979) Matroids, graphs, and 3-connectivity. In Graph Theory and Related Topics (J. A. Bondy and U. S. R. Murty, eds), Academic Press, New York, pp. 91-103.
6. Björner, A. (1992) The homology and shellability of matroids and geometric lattices. In Matroid Applications (N. White ed.), Cambridge University Press, Cambridge, pp. 226-283.
7. Boesch, F. T., Satyanarayana, A. and Suffel, C. L. (1990) Least reliable networks and the reliability domination. IEEE Trans. Comm. 38 2004-2009.
8. Brown, J. I. and Colbourn, C. J. (1996) Non-Stanley bounds for network reliability. J. Algebraic Combinatorics 5 13-36.
9. Brylawski, T. H. (1971) A combinatorial model for series-parallel networks. Trans. Amer. Math. Soc. 154 1-22.
10. Brylawski, T. H. (1972) A decomposition for combinatorial geometries. Trans. Amer. Math. Soc. 171 235-282.
11. Brylawski, T. H. (1980) The Tutte polynomial, Part I: General theory. In Matroid Theory and its Applications (A. Barlotti, ed.), Liguori, Naples, pp. 125-275.
12. Brylawski, T. H. and Oxley, J. G. (1992) The Tutte polynomial and its applications. In Matroid Applications (N. White, ed.), Cambridge University Press, Cambridge, pp. 123-225.
13. Bubley, R. and Dyer, M. (1997) Graph orientations with no sink and an approximation for a hard case of #SAT. In Proc. Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 248-257.
14. Chari, M. and Colbourn, C. J. (1997) Reliability polynomials: A survey. J. Combin. Inform. System Sci. 22 177-193.
15. Crapo, H. H. (1967) A higher invariant for matroids. J. Combin. Theory 2 406-417.
16. Cunningham, W. H. (1973) A combinatorial decomposition theory. PhD thesis, University of Waterloo.
17. Cunningham, W. H. and Edmonds, J. (1980) A combinatorial decomposition theory. Canad. J. Math. 32, 734-765.
18. Dinolt, G. W. (1971) An extremal problem for non-separable matroids. In Théorie des Matroïdes (C. P. Bruter, ed.), Vol. 211 of Lecture Notes in Mathematics, Springer, Berlin, pp. 31-49.
19. Dyer, M., Goldberg, L. A., Greenhill, C. and Jerrum, M. (2000) On the relative complexity of approximate counting problems. In Approximation Algorithms for Combinatorial Optimization: APPROX 2000 (K. Jansen and S. Khuller eds), Vol. 1913 of Lecture Notes in Computer Science, Springer, Berlin, pp. 108-120.
20. Ehrhart, E. (1977) Polynômes Arithmétiques et Méthodes des Polyédres en Combinatoire, Birkhäuser, Basel.
21. Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco.
22. Geelen, J. F., Gerards, A. M. H. and Whittle, G. (2002) Branch width and well-quasi-ordering in matroids and graphs. J. Combin. Theory, Ser. B 84 270-290.
23. Greene, C. and Zaslavsky, T. (1983) On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions and orientations of graphs. Trans. Amer. Math. Soc. 280 97-126.
24. Jaeger, F., Vertigan, D. L. and Welsh, D. J. A. (1990) On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Cambridge Philos. Soc. 108 35-53.
25. Khachiyan, L. (1995) On the complexity of approximating extremal determinants in matrices. J. Complexity 11 138-153.
26. Leo, J. W. (1998) The coefficients of the Tutte polynomial. Discrete Math. 184 121-135.
27. Liu, C. I. and Chow, Y. (1983) Enumeration of connected spanning subgraphs of a planar graph. Acta Mathematica Hungarica 41 27-36.
28. Murty, U. S. R. (1971) On the number of bases of a matroid. In Proc. Second Louisiana Conf. on Combinatorics, Louisiana State University, Baton Rouge, pp. 387-410.
29. Noble, S. (1998) Evaluating the Tutte polynomial for graphs of bounded tree-width. Combin. Probab. Comput. 7 307-322.
30. Oxley, J. G. (1982) On Crapo's beta invariant for matroids. Stud. Appl. Math. 66 267-277.
31. Oxley, J. G. (1992) Matroid Theory, Oxford University Press, New York.
32. Oxley, J. G. and Welsh, D. J. A. (1992) Tutte polynomials computable in polynomial time. Discrete Math. 109 185-192.
33. Przytycki, J. (1993) private communication.
34. Robertson, N. and Seymour, P. D. (1986) Graph minors, II: Algorithmic aspects of tree-width. J. Algorithms 7 309-322.
35. Robinson, G. C. and Welsh, D. J. A. (1980) The computational complexity of matroid properties. Math. Proc. Cambridge Philos. Soc. 87 29-45.
36. Tutte, W. T. (1966) Connectivity in matroids. Canad. J. Math. 18 1301-1324.
37. Vardy, A. (1997) The intractability of computing the minimum distance of a code. IEEE Trans. Inform. Theory 43 1757-1766.
38. Vertigan, D. L. (1991) On the computational complexity of Tutte, Jones, HOMFLY and Kauffman invariants. DPhil thesis, University of Oxford.
39. 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.
40. Welsh, D. J. A. (1993) Complexity: Knots, Colourings and Counting, Vol. 186 of London Mathematical Society Lecture Notes, Cambridge University Press, Cambridge.
41. Welsh, D. J. A. (1994) Randomized approximation in the Tutte plane. Combin. Probab. Comput. 3 137-143.