The following pages link to Martin Trinks (Q343775):
Displaying 10 items.
- A survey on recurrence relations for the independence polynomial of hypergraphs (Q343776) (← links)
- The covered components polynomial: a new representation of the edge elimination polynomial (Q426819) (← links)
- Recurrence relations and splitting formulas for the domination polynomial (Q456395) (← links)
- An abstraction of Whitney's broken circuit theorem (Q470960) (← links)
- Counting connected set partitions of graphs (Q625376) (← links)
- A note on a broken-cycle theorem for hypergraphs (Q2509555) (← links)
- Proving properties of the edge elimination polynomial using equivalent graph polynomials (Q2869336) (← links)
- From spanning forests to edge subsets (Q3191453) (← links)
- The Merrifield–Simmons Conjecture Holds for Bipartite Graphs (Q4916104) (← links)
- Polynomial reconstruction of the matching polynomial (Q5006550) (← links)
