Florian Zickfeld

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Geometric and combinatorial structures on graphs	2012-07-25	Paper
Improved bounds for spanning trees with many leaves Discrete Mathematics	2012-04-13	Paper
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs SIAM Journal on Discrete Mathematics	2012-03-15	Paper
On the number of planar orientations with prescribed degrees The Electronic Journal of Combinatorics	2009-04-07	Paper
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs Graph-Theoretic Concepts in Computer Science	2009-01-20	Paper
Schnyder woods and orthogonal surfaces Discrete & Computational Geometry	2008-09-24	Paper
On the Number of α-Orientations Graph-Theoretic Concepts in Computer Science	2008-07-01	Paper
Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms Lecture Notes in Computer Science	2008-04-15	Paper
Schnyder Woods and Orthogonal Surfaces Graph Drawing	2007-08-28	Paper
Reducing Hajós' 4-coloring conjecture to 4-connected graphs Journal of Combinatorial Theory. Series B	2006-07-12	Paper

Research outcomes over time

This page was built for person: Florian Zickfeld