[21] |
On symmetries of edge and vertex colourings of graphs. (with S. M. Smith) 2018, preprint. |
[pdf] |

[20] |
Distinguishing density and the Distinct Spheres Condition. (with W. Imrich and S. M. Smith) 2018, preprint. |
[pdf] |

[19] |
Hamilton decompositions of one-ended Cayley graphs. (with J. Erde and M. Pitz) 2017, preprint. |
[pdf] |

[18] |
Trees with distinguishing index equal distinguishing number plus one. (with S. Alikhani, S. Klavžar, and S. Soltani) 2017, preprint. |
[pdf] |

[17] |
Firefighting on trees and Cayley graphs. 2017, preprint. |
[pdf] |

[16] |
On tree-decompositions of one-ended graphs. (with J. Carmesin and R. G. Möller)
Mathematische Nachrichten, 2018, to appear. |
[pdf] |

[15] |
Non-reconstructible locally finite graphs. (with N. Bowler, J. Erde, P. Heinig, and M. Pitz)
Journal of Combinatorial Theory, Series B, 2018, to appear. |
[pdf] |

[14] |
A counterexample to the reconstruction conjecture for locally finite trees. (with N. Bowler, J. Erde, P. Heinig, and M. Pitz)
Bulletin of the London Mathematical Society, 49 (4), pp. 630 – 648, 2017. |
[pdf] |

[13] |
Breaking graph symmetries by edge colourings.
Journal of Combinatorial Theory, Series B, 127, pp. 205 – 214, 2017. |
[pdf] |

[12] |
Fast factorization of Cartesian products of (directed) hypergraphs. (with M. Hellmuth) Theoretical Computer Science, 615, pp. 1 – 11, 2016. |
[pdf] |

[11] |
Maximising the number of independent sets in connected graphs. (with S. Wagner) Graphs and Combinatorics, 33 (5), pp. 1103 – 1118, 2017. |
[pdf] |

[10] |
Local finiteness, distinguishing numbers and Tucker's conjecture. (with R. G. Möller) Electronic Journal of Combinatorics, 22 (4), 2015, research paper #P4.19. |
[pdf] |

[9] |
Pursuit evasion on infinite graphs. Theoretical Computer Science, 655 (Part A), pp. 30 – 40, 2016. |
[pdf] |

[8] |
The Cartesian product of graphs with loops. (with T. Boiko, J. Cuno, W. Imrich, and C. E. van de Woestijne)
Ars Mathematica Contemporanea, 11 (1), pp. 1 – 9, 2016. |
[pdf] |

[7] |
Clique trees of infinite locally finite chordal graphs. (with C. Temmel)
Electronic Journal of Combinatorics, 25 (2), 2018, research paper #P2.9. |
[pdf] |

[6] |
Extending cycles locally to Hamilton cycles. (with M. Hamann and J. Pott)
Electronic Journal of Combinatorics, 23 (1), 2016, research paper #P1.49. |
[pdf] |

[5] |
Random colorings and automorphism breaking in locally finite graphs.
Combinatorics, Probability and Computing, 22 (6), pp. 885 – 909, 2013. |
[pdf] |

[4] |
Distinguishing graphs with intermediate growth.
Combinatorica, 36 (3), pp. 333 – 347, 2016. |
[pdf] |

[3] |
Endomorphism breaking in graphs. (with W. Imrich, R. Kalinowski, and M. Pilśniak)
Electronic Journal of Combinatorics, 21 (1), 2014, research paper #P1.16. |
[pdf] |

[2] |
Distinguishing graphs with infinite motion and nonlinear growth. (with J. Cuno and W. Imrich)
Ars Mathematica Contemporanea, 7, pp. 201 – 213, 2014. |
[pdf] |

[1] |
On spanning tree packings of highly edge connected graphs.
Journal of Combinatorial Theory, Series B, 105, pp. 93 – 126, 2014. |
[pdf] |