Pages that link to "Item:Q2869336"
From MaRDI portal
The following pages link to Proving properties of the edge elimination polynomial using equivalent graph polynomials (Q2869336):
Displaying 7 items.
- Bivariate chromatic polynomials in computer algebra (Q1733312) (← links)
- A note on a broken-cycle theorem for hypergraphs (Q2509555) (← links)
- The universal edge elimination polynomial and the dichromatic polynomial (Q2857322) (← links)
- On the Tutte and Matching Polynomials for Complete Graphs (Q5038571) (← links)
- Harary polynomials (Q5056203) (← links)
- (Q5241134) (← links)
- A Most General Edge Elimination Polynomial (Q5302041) (← links)