Schnyder decompositions for regular plane graphs and application to drawing
From MaRDI portal
Publication:2429329
DOI10.1007/s00453-011-9514-5zbMath1239.05038arXiv1007.2484MaRDI QIDQ2429329
Publication date: 26 April 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.2484
straight-line drawing; Nash-Williams theorem; orthogonal drawing; Schnyder woods; forest decomposition; 4-regular map; Schnyder labelling
05C05: Trees
05C10: Planar graphs; geometric and topological aspects of graph theory
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Pentagon contact representations, 4-labelings and grid embeddings of plane quadrangulations, Unified bijections for maps with prescribed degrees and girth, A bijection for triangulations, quadrangulations, pentagulations, etc., Contact Representations of Graphs in 3D
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 4-labelings and grid embeddings of plane quadrangulations
- Baxter permutations and plane bipolar orientations
- A bijection for triangulations, quadrangulations, pentagulations, etc.
- Optimal coding and sampling of triangulations
- 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
- Planar graphs and poset dimension
- Lower bounds for planar orthogonal drawings of graphs
- A better heuristic for orthogonal graph drawings
- Lattice structures from planar graphs
- Drawing planar graphs using the canonical ordering
- Bijections for Baxter families and related objects
- Planar graphs, via well-orderly maps and trees
- ULD-Lattices and Δ-Bonds
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- New Lower Bounds For Orthogonal Drawings
- On topological aspects of orientations
- Convex drawings of planar graphs and the order dimension of 3-polytopes
