scientific article

zbMath1243.05003MaRDI QIDQ2900727

Florian Zickfeld

Publication date: 25 July 2012

Full work available at URL: http://opus.kobv.de/tuberlin/volltexte/2008/1739/pdf/zickfeld_florian.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

asymptotic enumerationplanar mapsspanning treespolynomial upper boundsSchnyder woodsexponential upper boundsstacked polytopesorthogonal surfacesbipolar orientationsalpha orientationsbalanced stacked polytopesblossom graphBrightwell-Trotter theoremdiamond necklacesface countinglinear stacked polytopesplanar orientationssmall integer realizationsspanning trees with many leavesweighted faces

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumerative combinatorics (05A99)

Related Items

Embedding stacked polytopes on a polynomial-size grid ⋮ Realizing Planar Graphs as Convex Polytopes ⋮ Improved bounds for spanning trees with many leaves ⋮ Small grid embeddings of 3-polytopes ⋮ A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs

Uses Software

• OEIS