Combinatorial characterization of upward planarity
From MaRDI portal
Publication:2316097
DOI10.1007/s40304-018-0169-2zbMath1416.05084arXiv1608.07255OpenAlexW3100059724MaRDI QIDQ2316097
Publication date: 26 July 2019
Published in: Communications in Mathematics and Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.07255
Combinatorics of partially ordered sets (06A07) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upward drawings of triconnected digraphs.
- A unified approach to visibility representations of planar graphs
- Fundamentals of planar ordered sets
- Algorithms for plane representations of acyclic digraphs
- The geometry of tensor calculus. I
- Upward planarity testing
- A graphical calculus for semi-groupal categories