Enumeration of corner polyhedra and 3-connected Schnyder labelings
From MaRDI portal
Publication:6161699
zbMath1515.52007MaRDI QIDQ6161699
Erkan Narmanli, Éric Fusy, Gilles Schaeffer
Publication date: 5 June 2023
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2022//75.html
Exact enumeration problems, generating functions (05A15) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (1)
Cites Work
- Unnamed Item
- Non-D-finite excursions in the quarter plane
- Intervals in Catalan lattices and realizers of triangulations
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Geodesic embeddings and planar graphs
- Bipolar orientations revisited
- Walks obeying two-step rules on the square lattice: full, half and quarter planes
- The On-Line Encyclopedia of Integer Sequences
- Random walks in cones
- Bipolar orientations on planar maps and \(\mathrm{SLE}_{12}\)
- Steinitz Theorems for Orthogonal Polyhedra
- Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
- Dichromatic polynomials and Potts models summed over rooted maps
- Convex drawings of planar graphs and the order dimension of 3-polytopes
- Enumeration of corner polyhedra and 3-connected Schnyder labelings
This page was built for publication: Enumeration of corner polyhedra and 3-connected Schnyder labelings
