Martin Trinks

According to our database, Martin Trinks authored at least 9 papers between 2011 and 2016.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2016

A Survey on Recurrence Relations for the Independence Polynomial of Hypergraphs.

Martin Trinks

Graphs Comb., 2016

2015

Polynomial reconstruction of the matching polynomial.

Xueliang Li, Yongtang Shi, Martin Trinks

Electron. J. Graph Theory Appl., 2015

2014

A note on a broken-cycle theorem for hypergraphs.

Martin Trinks

Discuss. Math. Graph Theory, 2014

An Abstraction of Whitney's Broken Circuit Theorem.

Klaus Dohmen, Martin Trinks

Electron. J. Comb., 2014

From spanning forests to edge subsets.

Martin Trinks

Ars Math. Contemp., 2014

2013

The Merrifield-Simmons Conjecture Holds for Bipartite Graphs.

Martin Trinks

J. Graph Theory, 2013

2012

The Covered Components Polynomial: A New Representation of the Edge Elimination Polynomial.

Martin Trinks

Electron. J. Comb., 2012

Recurrence Relations and Splitting Formulas for the Domination Polynomial.

Tomer Kotek, James Preen, Frank Simon, Peter Tittmann, Martin Trinks

Electron. J. Comb., 2012

2011

Counting Connected Set Partitions of Graphs.

Frank Simon, Peter Tittmann, Martin Trinks

Electron. J. Comb., 2011