Parity, Eulerian subgraphs and the Tutte polynomial

DOI10.1016/J.JCTB.2007.09.006zbMath1162.05019arXiv0707.2306OpenAlexW2021450686MaRDI QIDQ2483482

Andrew J. Goodall

Publication date: 28 April 2008

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.2306

zbMATH Keywords

correlationFourier transformweight enumeratorTutte polynomialparityEulerian subgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Evaluations of Graph Polynomials ⋮ Congruence conditions, parcels, and Tutte polynomials of graphs and matroids ⋮ One More Probabilistic Reformulation of the Four Colour Conjecture ⋮ Connection Matrices for MSOL-Definable Structural Invariants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nowhere-zero flow polynomials
• Coboundaries, flows, and Tutte polynomials of matrices
• Map coloring and the vector cross product
• Colorings and orientations of graphs
• The graph polynomial and the number of proper vertex colorings
• A note on graph colorings and graph polynomials
• The number of edge 3-colorings of a planar cubic graph as a permanent
• Some new evaluations of the Tutte polynomial
• List edge colourings of some 1-factorable multigraphs
• Support weight enumerators and coset weight distributions of isodual codes
• On the Principal Edge Tripartition of a Graph
• Combinatorial Nullstellensatz
• Some probabilistic restatements of the Four Color Conjecture

This page was built for publication: Parity, Eulerian subgraphs and the Tutte polynomial