Level Planarity: Transitivity vs. Even Crossings
Discrete Mathematics
2018-08-30 v1 Data Structures and Algorithms
Abstract
Recently, Fulek et al. 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.
Keywords
Cite
@article{arxiv.1808.09931,
title = {Level Planarity: Transitivity vs. Even Crossings},
author = {Guido Brückner and Ignaz Rutter and Peter Stumpf},
journal= {arXiv preprint arXiv:1808.09931},
year = {2018}
}
Comments
Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018)