On the number of planar Eulerian orientations
From MaRDI portal
Publication:2400972
DOI10.1016/j.ejc.2017.04.009zbMath1369.05110arXiv1610.09837OpenAlexW2963234681MaRDI QIDQ2400972
Claire Pennarun, Mireille Bousquet-Mélou, Paul Dorbec, Nicolas Bonichon
Publication date: 31 August 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.09837
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Related Items
The six-vertex model on random planar maps revisited, Counting planar Eulerian orientations, The generating function of planar Eulerian orientations, Eulerian orientations and the six-vertex model on planar maps, Inhomogeneous restricted lattice walks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- Baxter permutations and plane bipolar orientations
- Counting colored random triangulations
- Optimal coding and sampling of triangulations
- Succinct representations of planar maps
- Intervals in Catalan lattices and realizers of triangulations
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- Bijective counting of plane bipolar orientations and Schnyder woods
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Enumeration of planar constellations
- Lattice structures from planar graphs
- Chromatic sums revisited
- Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
- Counting colored planar maps: algebraicity results
- Counting coloured planar maps: differential equations
- Bijections for Baxter families and related objects
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- On the existence of square roots in certain rings of power series
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
- Bijective Counting of Involutive Baxter Permutations
- Algebraic approximants: a new method of series analysis
- Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation
- Random self-avoiding walks on one-dimensional lattices
- Blocked edges on Eulerian maps and mobiles: application to spanning trees, hard particles and the Ising model
- Effect of Confinement: Polygons in Strips, Slabs and Rectangles
- General Néron desingularization and approximation
- GFUN
- Loop models on random maps via nested loops: the case of domain symmetry breaking and application to the Potts model
- Random geometry on the sphere
- On the Enumeration of Tree-Rooted Maps
- On the enumeration of planar maps
- Chromatic Sums for Rooted Planar Triangulations: The Cases λ = 1 and λ = 2
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
- A Census of Planar Maps
- The Potts-\(q\) random matrix model: Loop equations, critical exponents, and rational case.
- Exact solution of the six-vertex model on a random lattice.
- Dichromatic polynomials and Potts models summed over rooted maps
