2018
DOI: 10.1007/978-3-030-04414-5_3
|View full text |Cite
|
Sign up to set email alerts
|

Level Planarity: Transitivity vs. Even Crossings

Abstract: Recently, Fulek et al. [5,6,7] 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. [14] is equivalent to the strong Hanani-Tutte theorem for level planarity [7]. Further, we show that this relationship carries over to radial level planarity, which yields a novel polynomia… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…The task is to order the vertices on each level so that the drawing is planar. Level planarity can be tested in linear time [25] by a quite involved algorithm, or in quadratic time by several simpler algorithms [10,28,19].…”
Section: Introductionmentioning
confidence: 99%
“…The task is to order the vertices on each level so that the drawing is planar. Level planarity can be tested in linear time [25] by a quite involved algorithm, or in quadratic time by several simpler algorithms [10,28,19].…”
Section: Introductionmentioning
confidence: 99%