Florian Zickfeld

According to our database, Florian Zickfeld authored at least 7 papers between 2006 and 2012.

Collaborative distances:

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

2012

Improved bounds for spanning trees with many leaves.

Paul S. Bonsma, Florian Zickfeld

Discret. Math., 2012

2011

A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.

Paul S. Bonsma, Florian Zickfeld

SIAM J. Discret. Math., 2011

2008

Schnyder Woods and Orthogonal Surfaces.

Stefan Felsner, Florian Zickfeld

Discret. Comput. Geom., 2008

On the Number of Planar Orientations with Prescribed Degrees.

Stefan Felsner, Florian Zickfeld

Electron. J. Comb., 2008

Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms.

Paul S. Bonsma, Florian Zickfeld

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

On the Number of <i>alpha</i> -Orientations.

Stefan Felsner, Florian Zickfeld

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006

Reducing Hajós' 4-coloring conjecture to 4-connected graphs.

Xingxing Yu, Florian Zickfeld

J. Comb. Theory, Ser. B, 2006