Decomposing graphs into a constant number of locally irregular subgraphs J Bensmail, M Merker, C Thomassen
European Journal of Combinatorics 60, 124-134, 2017
43 2017 A proof of the Barát–Thomassen conjecture J Bensmail, A Harutyunyan, TN Le, M Merker, S Thomassé
Journal of Combinatorial Theory, Series B 124, 39-55, 2017
21 2017 Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree M Merker
Journal of Combinatorial Theory, Series B 122, 91-108, 2017
16 2017 A counterexample to Montgomery’s conjecture on dynamic colourings of regular graphs N Bowler, J Erde, F Lehner, M Merker, M Pitz, K Stavropoulos
Discrete Applied Mathematics 229, 151-153, 2017
12 2017 Graph Decompositions. M Merker
Technical University of Denmark, 2016
11 * 2016 Bounded diameter arboricity M Merker, L Postle
Journal of Graph Theory 90 (4), 629-641, 2019
9 2019 Decomposing graphs into a spanning tree, an even graph, and a star forest KS Lyngsie, M Merker
The Electronic Journal of Combinatorics, P1. 33-P1. 33, 2019
5 2019 Gaps in the cycle spectrum of 3-connected cubic planar graphs M Merker
Journal of Combinatorial Theory, Series B 146, 68-75, 2021
4 2021 Cycle lengths modulo KS Lyngsie, M Merker
arXiv preprint arXiv:1904.05076, 2019
4 2019 Decomposing series-parallel graphs into paths of length 3 and triangles M Merker
Electronic Notes in Discrete Mathematics 49, 367-370, 2015
4 2015 Counterexamples to Thomassen’s conjecture on decomposition of cubic graphs T Bellitto, T Klimošová, M Merker, M Witkowski, Y Yuditsky
Graphs and Combinatorics 37, 2595-2599, 2021
1 2021 Spanning trees without adjacent vertices of degree 2 KS Lyngsie, M Merker
Discrete Mathematics 342 (12), 111604, 2019
1 2019 