Combinatorial characterization of upward planarity
Combinatorics
2019-01-08 v6 Discrete Mathematics
Abstract
We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.
Cite
@article{arxiv.1608.07255,
title = {Combinatorial characterization of upward planarity},
author = {Xuexing Lu and Yu Ye},
journal= {arXiv preprint arXiv:1608.07255},
year = {2019}
}
Comments
15 pages. To appear in Communications in Mathematics and Statistics