On the number of planar orientations with prescribed degrees
From MaRDI portal
Publication:1010800
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
05C30: Enumeration in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05A16: Asymptotic enumeration
Related Items
Straight line triangle representations, On the order dimension of outerplanar maps, Symmetries of unlabelled planar triangulations, Distance between \(\alpha\)-orientations of plane graphs by facial cycle reversals, Counting planar Eulerian orientations, 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, New upper bounds for the number of embeddings of minimally rigid graphs, Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators, Bijections for Baxter families and related objects, Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings, Mixing Times of Markov Chains of 2-Orientations, Sampling and Counting 3-Orientations of Planar Triangulations
Uses Software
