Combinatorial characterization of upward planarity
classification
🧮 math.CO
cs.DM
keywords
upwardcharacterizationcombinatorialplanaredgeextensionsgivegraphs
read the original abstract
We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.