Parity, eulerian subgraphs and the Tutte polynomial

Journal of Combinatorial Theory. Series B

Volumn 98, Issue 3, 2008, Pages 599-628

  Goodall, A J ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Correlation; Eulerian subgraphs; Fourier transform; Parity; Tutte polynomial; Weight enumerator

Indexed keywords

EID: 41049110430     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2007.09.006     Document Type: Article

References (20)

1. Alon N. Combinatorial Nullstellensatz. Combin. Probab. Comput. 8 1 & 2 (1999) 7-29
2. Alon N., and Tarsi M. Colorings and orientations of graphs. Combinatorica 12 (1992) 125-134
3. Alon N., and Tarsi M. A note on graph colorings and graph polynomials. J. Combin. Theory Ser. B 70 (1997) 197-201
4. Bollobás B. Modern Graph Theory (1998), Springer, New York
5. Ellingham M.N., and Goddyn L. List edge colourings of some 1-factorable multigraphs. Combinatorica 16 (1996) 343-352
6. Goodall A. Some new evaluations of the Tutte polynomial. J. Combin. Theory Ser. B 96 (2006) 207-224
7. Goodall A. Fourier analysis on finite abelian groups: Some graphical applications. Chapter 7 in:. In: Grimmett G., and McDiarmid C. (Eds). Combinatorics, Complexity, Chance: A Tribute to Dominic Welsh. Oxford Lecture Ser. Math. Appl. vol. 34 (2007), Oxford Univ. Press, Oxford 103-129
8. Kaufmann L. Map coloring and the vector cross product. J. Combin. Theory Ser. B 48 (1990) 145-154
9. J. Kung, Coboundary, flows and Tutte polynomials of matrices, Ann. Combin., in press
10. Matiyasevich Y. Some probabilistic restatements of the four color conjecture. J. Graph Theory 46 (2004) 167-179
11. Milenkovic O. Support weight enumerators and coset weight distributions of isodual codes. Des. Codes Cryptogr. 35 1 (2005) 81-109
12. Onn S. Nowhere-zero flow polynomials. J. Combin. Theory Ser. A 108 (2004) 205-215
13. Penrose R. Applications of negative dimensional tensors. In: Welsh D. (Ed). Combinatorial Mathematics and its Applications (1971), Academic Press, New York, London 221-244
14. Read R.C., and Rosenstiehl P. On the principal edge tripartition of a graph. Ann. Discrete Math. 3 (1978) 195-226
15. Scheim D.E. The number of edge 3-colorings of a planar cubic graph as a permanent. Discrete Math. 8 (1974) 377-382
16. Stanley R. Enumerative Combinatorics, vol. 1 (1997), Cambridge Univ. Press
17. Tarsi M. The graph polynomial and the number of proper vertex colorings. Ann. Inst. Fourier 49 3 (1999) 1089-1093
18. Terras A. Fourier Analysis on Finite Groups and Applications (1999), Cambridge Univ. Press
19. van der Waerden B. Die lange Reichweite der regelmässigen Atomanordnung in Mischkristallen. Z. Physik 118 (1941) 473
20. Welsh D. Complexity: Knots, Colourings and Counting (1993), Cambridge Univ. Press