Level Planarity: Transitivity vs. Even Crossings
Recently, Fulek et al. [1, 2, 3] have presented Hanani-Tutte results for (radial) level planarity, i.e., a graph is (radial) level planar if it admits a (radial) level drawing where any two (independent) edges cross an even number of times. We show that the 2-Sat formulation of level planarity testing due to Randerath et al.  is equivalent to the strong Hanani-Tutte theorem for level planarity . Further, we show that this relationship carries over to radial level planarity, which yields a novel polynomial-time algorithm for testing radial level planarity.
- 9.Brückner, G., Rutter, I.: Partial and constrained level planarity. In: Klein, P.N. (ed.) Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pp. 2000–2011. SIAM (2017)Google Scholar
- 14.Pach, J., Tóth, G.: monotone drawings of planar graphs. ArXiv:1101.0967 e-prints (2011)
- 15.Brückner, G., Rutter, I., Stumpf, P.: Level planarity: transitivity vs. even crossings. CoRR abs/1808.09931 (2018)Google Scholar