On ( k , l)-Leaf Powers. - Andreas Brandstädt; Peter Wagner 002 (MFCS, 2007)

Complete graphs with no rainbow path. - Andrew Thomason 001; Peter Wagner 002 (J. Graph Theory, 2007)

On k-Versus (k+1)-Leaf Powers. - Andreas Brandstädt; Peter Wagner 002 (COCOA, 2008)

Bounding the size of square-free subgraphs of the hypercube. - Andrew Thomason 001; Peter Wagner 002 (Discret. Math., 2009)

The complete inclusion structure of leaf power classes. - Peter Wagner 002; Andreas Brandstädt (Theor. Comput. Sci., 2009)

Characterising (k, l)-leaf powers. - Andreas Brandstädt; Peter Wagner 002 (Discret. Appl. Math., 2010)

Rooted directed path graphs are leaf powers. - Andreas Brandstädt; Christian Hundt 001; Federico Mancini 001; Peter Wagner 002 (Discret. Math., 2010)

Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree. - Klas Markström; Andrew Thomason 001; Peter Wagner 002 (Graphs Comb., 2011)

Complete graphs with no rainbow tree. - Jan-Christoph Schlage-Puchta; Peter Wagner 002 (J. Graph Theory, 2020)