4-connected triangulations on few lines
From MaRDI portal
Publication:2206872
DOI10.1007/978-3-030-35802-0_30OpenAlexW2990795852MaRDI QIDQ2206872
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1908.04524
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- A short proof of the existence of k-saturated partitions of partially ordered sets
- On chain and antichain families of a partially ordered set
- Area requirement and symmetry display of planar upward drawings
- An extension of Schensted's theorem
- Some partitions associated with a partially ordered set
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Track layouts, layered path decompositions, and leveled planarity
- Bipolar orientations revisited
- Line and plane cover numbers revisited
- The complexity of drawing graphs on few lines and few planes
- Drawing Graphs on Few Lines and Few Planes
- Forbidden Configurations in Discrete Geometry
- Cubic Planar Graphs that cannot be Drawn on few Lines
- The structure of Sperner k-families
This page was built for publication: 4-connected triangulations on few lines
