In the constrained planarity setting, we ask whether a graph can be drawn such that no edges cross and that some given further constraints are satisfied. Click on one of the problem variants below to explore what these constraints may look like, or read more about this website on the About page.
This hierarchy was initially suggested by Schaefer (2013) and later extended by Da Lozzo (2015).
References
Da Lozzo, Giordano. 2015. “Planar Graphs with Vertices in Prescribed Regions:models, Algorithms, and Complexity.” PhD thesis, Roma Tre University. http://www.dia.uniroma3.it/~dalozzo/files/phd-thesis-giordano-dalozzo.pdf.
Schaefer, Marcus. 2013. “Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants.” Journal of Graph Algorithms and Applications 17 (4): 367–440. https://doi.org/10.7155/jgaa.00298.