Decomposing series-parallel graphs into paths of length 3 and triangles. - Martin Merker (Electron. Notes Discret. Math., 2015)

Graph Decompositions. - Martin Merker (2016)

A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs. - Nathan J. Bowler; Joshua Erde; Florian Lehner; Martin Merker; Max Pitz; Konstantinos S. Stavropoulos (Discret. Appl. Math., 2017)

Decomposing graphs into a constant number of locally irregular subgraphs. - Julien Bensmail; Martin Merker; Carsten Thomassen (Eur. J. Comb., 2017)

A proof of the Barát-Thomassen conjecture. - Julien Bensmail; Ararat Harutyunyan; Tien-Nam Le; Martin Merker; Stéphan Thomassé (J. Comb. Theory B, 2017)

Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree. - Martin Merker (J. Comb. Theory B, 2017)

Decomposing Graphs into a Spanning Tree, an Even Graph, and a Star Forest. - Kasper Szabo Lyngsie; Martin Merker (Electron. J. Comb., 2019)

Spanning trees without adjacent vertices of degree 2. - Kasper Szabo Lyngsie; Martin Merker (Discret. Math., 2019)

Bounded diameter arboricity. - Martin Merker; Luke Postle (J. Graph Theory, 2019)

Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs. - Thomas Bellitto; Tereza Klimosová; Martin Merker; Marcin Witkowski; Yelena Yuditsky (Graphs Comb., 2021)

Gaps in the cycle spectrum of 3-connected cubic planar graphs. - Martin Merker (J. Comb. Theory B, 2021)