Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4950902 | Information Processing Letters | 2017 | 7 Pages |
Abstract
We show that a planar graph admits a monotone drawing with only one direction of monotonicity if and only if it has a Hamiltonian path between two vertices lying in the same face. Also, we prove that maximal planar graphs admit monotone drawings with two (orthogonal) directions, while triconnected planar graphs with three directions. The latter two results are obtained by applying the famous drawing algorithm based on Schnyder realizers.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Patrizio Angelini,