A Graph Integral Formulation of the Circuit Partition Polynomial
From MaRDI portal
Publication:3103635
DOI10.1017/S0963548311000393zbMath1234.05126OpenAlexW2169694889MaRDI QIDQ3103635
Alexander Russell, Moore, Cristopher
Publication date: 8 December 2011
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548311000393
Graph polynomials (05C31) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- On Tutte polynomials and cycles of plane graphs
- On the structure of Brauer's centralizer algebras
- On the evaluation at (3,3) of the Tutte polynomial of a graph
- Tutte-Martin polynomials and orienting vectors of isotropic systems
- New results for the Martin polynomial
- Evaluations of the circuit partition polynomial
- On algebras which are connected with the semisimple continuous groups
- Distance Hereditary Graphs and the Interlace Polynomial
- The Computational Complexity of Tutte Invariants for Planar Graphs
- The Evaluation of the Collision Matrix
