Peter Wagner

According to our database, Peter Wagner authored at least 9 papers between 2007 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

Complete graphs with no rainbow tree.

Jan-Christoph Schlage-Puchta, Peter Wagner

J. Graph Theory, 2020

2011

Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree.

Klas Markström, Andrew Thomason, Peter Wagner

Graphs Comb., 2011

2010

Rooted directed path graphs are leaf powers.

Andreas Brandstädt, Christian Hundt, Federico Mancini, Peter Wagner

Discret. Math., 2010

Characterising (k, <i>l</i>)-leaf powers.

Andreas Brandstädt, Peter Wagner

Discret. Appl. Math., 2010

2009

The complete inclusion structure of leaf power classes.

Peter Wagner, Andreas Brandstädt

Theor. Comput. Sci., 2009

Bounding the size of square-free subgraphs of the hypercube.

Andrew Thomason, Peter Wagner

Discret. Math., 2009

2008

On k-Versus (k+1)-Leaf Powers.

Andreas Brandstädt, Peter Wagner

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Complete graphs with no rainbow path.

Andrew Thomason, Peter Wagner

J. Graph Theory, 2007

On ( <i>k</i> , <i>l</i>)-Leaf Powers.

Andreas Brandstädt, Peter Wagner

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007