Evaluations of the circuit partition polynomial

DOI10.1006/jctb.2001.2102zbMath1023.05090OpenAlexW2028239976MaRDI QIDQ1850612

Béla Bollobás

Publication date: 10 December 2002

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

Full work available at URL: https://semanticscholar.org/paper/545c859e6386d83bbffb9960bd09eee759e72d13

zbMATH Keywords

EulerianMartin polynomial

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

Graph parameters from symplectic group invariants ⋮ Homomorphisms and Polynomial Invariants of Graphs ⋮ Statistics of Feynman amplitudes in \(\phi^4\)-theory ⋮ Fast evaluation of interlace polynomials on graphs of bounded treewidth ⋮ Identities for circuit partition polynomials, with applications to the Tutte polynomial ⋮ Distance Hereditary Graphs and the Interlace Polynomial ⋮ The interlace polynomial of a graph ⋮ 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 ⋮ A Graph Integral Formulation of the Circuit Partition Polynomial ⋮ Exploring the Tutte-Martin connection ⋮ Homomorphisms and polynomial invariants of graphs

Cites Work

• On Tutte polynomials and cycles of plane graphs
• 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
• Le Polynôme De Martin D'un Graphe Eulerien
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Evaluations of the circuit partition polynomial