arXiv Analytics

Sign in

arXiv:1101.0967 [math.CO]AbstractReferencesReviewsResources

Monotone drawings of planar graphs

Janos Pach, Geza Toth

Published 2011-01-05Version 1

Let G be a graph drawn in the plane so that its edges are represented by x-monotone curves, any pair of which cross an even number of times. We show that G can be redrawn in such a way that the x-coordinates of the vertices remain unchanged and the edges become non-crossing straight-line segments.

Related articles: Most relevant | Search more
arXiv:0909.2613 [math.CO] (Published 2009-09-14, updated 2010-07-30)
k-L(2,1)-Labelling for Planar Graphs is NP-Complete for k >= 4
arXiv:1409.2426 [math.CO] (Published 2014-09-08)
Some NP-complete edge packing and partitioning problems in planar graphs
arXiv:1606.03782 [math.CO] (Published 2016-06-12)
Graphs with obstacle number greater than one