[14] |
A counterexample to the reconstruction conjecture for locally finite trees. (with N. Bowler, J. Erde, P. Heinig, and M. Pitz) 2016, submitted. |
[pdf] |

[13] |
Breaking graph symmetries by edge colourings. 2016, submitted. |
[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) 2015, submitted. |
[pdf] |

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

[9] |
Pursuit evasion on infinite graphs. Theoretical Computer Science, 2016, to appear. |
[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)
2013, submitted. |
[pdf] |

[6] |
Extending cycles locally to Hamilton cycles. (with M. Hamann and J. Pott)
Electronic Journal of Combinatorics, 23 (1), 2016, research paper #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, 2013, to appear. |
[pdf] |

[3] |
Endomorphism breaking in graphs. (with W. Imrich, R. Kalinowski, and M. Pilśniak)
Electronic Journal of Combinatorics, 21 (1), 2014, research paper #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] |