Proving properties of the edge elimination polynomial using equivalent graph polynomials
From MaRDI portal
Publication:2869336
zbMath1278.05127arXiv1205.2205MaRDI QIDQ2869336
Publication date: 3 January 2014
Full work available at URL: https://arxiv.org/abs/1205.2205
Related Items (5)
On the Tutte and Matching Polynomials for Complete Graphs ⋮ Harary polynomials ⋮ Unnamed Item ⋮ Bivariate chromatic polynomials in computer algebra ⋮ A note on a broken-cycle theorem for hypergraphs
This page was built for publication: Proving properties of the edge elimination polynomial using equivalent graph polynomials
