Combinatorial characterization of upward planarity
Abstract
We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.