Bicycle Dimension and Special Points of the Tutte Polynomial

Journal of Combinatorial Theory. Series B

Volumn 74, Issue 2, 1998, Pages 378-396

  Vertigan, Dirk ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

P complete; Computational complexity; Matroids; Polynomial time; Tutte polynomial

Indexed keywords

EID: 0038901795     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1998.1860     Document Type: Article

References (20)

1. Bixby R. E. On Reid's characterization of the ternary matroids. J. Combin. Theory Ser. B. 26:1979;174-204.
2. Brylawski T. H. A decomposition for combinatorial geometries. Trans. Amer. Math. Soc. 171:1972;235-282.
3. Brylawski T. H. The Tutte polynomial. Matroid Theory and Its Applications. 1980;Centro Internazionale Matematico Estivo. p. 125-275.
4. C. R. Coullard, J. G. Oxley, D. L. Vertigan, A polynomial time algoritm for constructing a representation of a quaternary matroid from a rank oracle.
5. Crapo H. The Tutte polynomial. Aequationes Math. 3:1969;211-229.
6. Cunningham W. H. A Combinatorial Decomposition Theory. 1973;University of Waterloo.
7. J. F. Geelen, A. M. H. Gerards, A. Kapoor, The excluded minors for GF(4)-representable matroids.
8. J. F. Geelen, J. G. Oxley, D. L. Vertigan, G. P. Whittle, On the excluded minors for quaternary matroids.
9. Greene C. Weight enumeration and the geometry of linear codes. Stud. Appl. Math. 55:1976;119-128.
10. Jaeger F. Tutte polynomials and bicycle dimension of ternary matroids. Proc. Amer. Math. Soc. 107:1989;17-25.
11. Jaeger F., Vertigan D. L., Welsh D. J. A. On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Cambridge Philos. Soc. 108:1990;35-53.
12. Oxley J. G. Matroid Theory. 1992;Oxford Univ. Press, New York.
13. Seymour P. D. Matroid representation over GF(3). J. Combin. Theory, Ser. B. 26:1979;159-173.
14. Tutte W. T. A homotopy theorem for matroids, I, II. Trans. Amer. Math. Soc. 88:1958;144-174.
15. Tutte W. T. A ring in graph theory. Proc. Cambridge Philos. Soc. 43:1947;26-40.
16. Valiant L. G. The complexity of enumeration and reliability problems. SIAM. J. Comput. 8:1979;410-421.
17. D. Vertigan, Counting bases in matroids.
18. Vertigan D. On the Computational Complexity of Tutte, Jones, Homfly and Kauffman Invariants. 1991;University of Oxford.
19. Welsh D. J. A. Complexity: Knots, Colourings and Counting. London Mathematical Society Lecture Note Series 186. 1993;Cambridge Univ. Press, Cambridge.
20. Whitney H. A logical expansion in mathematics. Bull. Amer. Math. 57:1935;509-533.