Identities for circuit partition polynomials, with applications to the Tutte polynomial

DOI10.1016/S0196-8858(03)00079-4zbMath1053.05069MaRDI QIDQ1433000

Joanna A. Ellis-Monaghan

Publication date: 15 June 2004

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Eulerian graphsTutte polynomialEulerian orientationsGraph polynomialsMartin polynomialDigraphsCircuit partition polynomialGraph invariantsOriented graphs

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items

The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems ⋮ Graph parameters from symplectic group invariants ⋮ Extremal graphs for the Tutte polynomial ⋮ Interlace polynomials of 4n-snowflake graphs ⋮ Distance Hereditary Graphs and the Interlace Polynomial ⋮ A recipe theorem for the topological Tutte polynomial of Bollobás and Riordan ⋮ Mixed partition functions and exponentially bounded edge-connection rank ⋮ Circle graphs and the cycle double cover conjecture ⋮ Entanglement criteria for the bosonic and fermionic induced ensembles

Cites Work

• Isotropic systems
• On the evaluation at (3,3) of the Tutte polynomial of a graph
• Tutte-Martin polynomials and orienting vectors of isotropic systems
• Remarkable valuation of the dichromatic polynomial of planar multigraphs
• New results for the Martin polynomial
• Exploring the Tutte-Martin connection
• Evaluations of the circuit partition polynomial
• Le Polynôme De Martin D'un Graphe Eulerien
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item