11 citations · 23 across the 10 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.CO2012
A note on a Broken-cycle Theorem for hypergraphs
Martin Trinks
Whitney's Broken-cycle Theorem states the chromatic polynomial of a graph as a sum over special edge subsets. We give a definition of cycles in hypergraphs that preserves the state…
math.CO2012★ 1 cited
Recurrence relations and splitting formulas for the domination polynomial
Tomer Kotek, James Preen, Frank Simon +2
The domination polynomial D(G,x) of a graph G is the generating function of its dominating sets. We prove that D(G,x) satisfies a wide range of reduction formulas. We show linear r…
math.CO2012★ 2 cited
Proving properties of the edge elimination polynomial using equivalent graph polynomials
Martin Trinks
Averbouch, Godlin and Makowsky define the edge elimination polynomial of a graph by a recurrence relation with respect to the deletion, contraction and extraction of an edge. It ge…