On the number of planar orientations with prescribed degrees

zbMath1182.05058arXivmath/0701771MaRDI QIDQ1010800

Stefan Felsner, Florian Zickfeld

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0701771

zbMATH Keywords

asymptotic enumerationplanar mapsnumber of \(\alpha\)-orientations

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16)

Related Items (13)

New upper bounds for the number of embeddings of minimally rigid graphs ⋮ Symmetries of unlabelled planar triangulations ⋮ Bijections for Baxter families and related objects ⋮ Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators ⋮ On the order dimension of outerplanar maps ⋮ Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings ⋮ Distance between \(\alpha\)-orientations of plane graphs by facial cycle reversals ⋮ Counting planar Eulerian orientations ⋮ Straight line triangle representations ⋮ On the area requirements of planar greedy drawings of triconnected planar graphs ⋮ On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs ⋮ Mixing Times of Markov Chains of 2-Orientations ⋮ Sampling and Counting 3-Orientations of Planar Triangulations

Uses Software

• OEIS

This page was built for publication: On the number of planar orientations with prescribed degrees