2 papers
math.CO2007
Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
Paul Bonsma, Florian Zickfeld
It is known that graphs on n vertices with minimum degree at least 3 have spanning trees with at least n/4+2 leaves and that this can be improved to (n+4)/3 for cubic graphs withou…
math.CO2007
On the Number of Planar Orientations with Prescribed Degrees
S. Felsner, F. Zickfeld
We deal with the asymptotic enumeration of combinatorial structures on planar maps. Prominent instances of such problems are the enumeration of spanning trees, bipartite perfect ma…