Fulek et al. (2013, 2016, 2017) 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. (2001) is equivalent to the strong Hanani-Tutte theorem for level-planarity (2013). By elevating this relationship to radial level-planarity, we obtain a novel polynomial-time algorithm for testing radial level-planarity in the spirit of Randerath et al.
@article{10_37236_10814,
author = {Guido Br\"uckner and Ignaz Rutter and Peter Stumpf},
title = {Level-planarity: transitivity vs. even crossings},
journal = {The electronic journal of combinatorics},
year = {2022},
volume = {29},
number = {4},
doi = {10.37236/10814},
zbl = {1503.05025},
url = {http://geodesic.mathdoc.fr/articles/10.37236/10814/}
}
TY - JOUR
AU - Guido Brückner
AU - Ignaz Rutter
AU - Peter Stumpf
TI - Level-planarity: transitivity vs. even crossings
JO - The electronic journal of combinatorics
PY - 2022
VL - 29
IS - 4
UR - http://geodesic.mathdoc.fr/articles/10.37236/10814/
DO - 10.37236/10814
ID - 10_37236_10814
ER -
%0 Journal Article
%A Guido Brückner
%A Ignaz Rutter
%A Peter Stumpf
%T Level-planarity: transitivity vs. even crossings
%J The electronic journal of combinatorics
%D 2022
%V 29
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/10814/
%R 10.37236/10814
%F 10_37236_10814
Guido Brückner; Ignaz Rutter; Peter Stumpf. Level-planarity: transitivity vs. even crossings. The electronic journal of combinatorics, Tome 29 (2022) no. 4. doi: 10.37236/10814
