A subset expansion of the coloured tutte polynomial

Combinatorics Probability and Computing

Volumn 13, Issue 2, 2004, Pages 269-275

  Traldi, Lorenzo ^a  

^a LAFAYETTE COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; GRAPH THEORY; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; MATRIX ALGEBRA; POLYNOMIALS; STATISTICAL MECHANICS; TELECOMMUNICATION NETWORKS;

COLOURED GRAPHS; CYCLE MATROIDS; KNOT THEORY; TUTTE POLYNOMIALS;

SET THEORY;

EID: 3142569158     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548303005972     Document Type: Review

References (12)

1. Bollobás, B. (1998) Modem Graph Theory, Springer, New York.
2. Bollobás, B., Pebody, L. and Riordan, O. (2000) Contraction-deletion invariants for graphs. J. Combin. Theory Ser. B 80 320-345.
3. Bollobás, B. and Riordan, O. (1999) A Tutte polynomial for coloured graphs. Combin. Prob. Comput. 8 45-93.
4. Gordon, G. and Traldi, L. (1990) Generalized activities and the Tutte polynomial. Discrete Math. 85 167-176.
5. Oxley, J. G. (1992) Matroid Theory, Oxford University Press, Oxford.
6. Tutte, W. T. (1947) A ring in graph theory. Proc. Cambridge Philos. Soc. 43 26-40.
7. Tutte, W. T. (1984) Graph Theory, Cambridge University Press, Cambridge.
8. Welsh, D. J. A. (1995) Complexity: Knots, Colourings and Counting, Cambridge University Press, Cambridge.
9. White, N., ed. (1986) Theory of Matroids, Cambridge University Press, Cambridge.
10. White, N., ed. (1992) Matroid Applications, Cambridge University Press, Cambridge.
11. Whitney, H. (1932) A logical expansion in mathematics. Bull. Amer. Math. Soc. 38 572-579.
12. Zaslavsky, T. (1992) Strong Tutte functions of matroids and graphs. Trans. Amer. Math. Soc. 334 317-347.