Counting Connected Set Partitions of Graphs. - Frank Simon; Peter Tittmann 001; Martin Trinks (Electron. J. Comb., 2011)

Recurrence Relations and Splitting Formulas for the Domination Polynomial. - Tomer Kotek; James Preen; Frank Simon; Peter Tittmann 001; Martin Trinks (Electron. J. Comb., 2012)

The Covered Components Polynomial: A New Representation of the Edge Elimination Polynomial. - Martin Trinks (Electron. J. Comb., 2012)

The Merrifield-Simmons Conjecture Holds for Bipartite Graphs. - Martin Trinks (J. Graph Theory, 2013)

From spanning forests to edge subsets. - Martin Trinks (Ars Math. Contemp., 2014)

An Abstraction of Whitney's Broken Circuit Theorem. - Klaus Dohmen; Martin Trinks (Electron. J. Comb., 2014)

A note on a broken-cycle theorem for hypergraphs. - Martin Trinks (Discuss. Math. Graph Theory, 2014)

Polynomial reconstruction of the matching polynomial. - Xueliang Li 001; Yongtang Shi; Martin Trinks (Electron. J. Graph Theory Appl., 2015)

A Survey on Recurrence Relations for the Independence Polynomial of Hypergraphs. - Martin Trinks (Graphs Comb., 2016)