Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants

From MaRDI portal
Publication:2842198

DOI10.7155/jgaa.00298zbMath1292.05094OpenAlexW1996152705MaRDI QIDQ2842198

Marcus Schaefer

Publication date: 13 August 2013

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00298




Related Items (32)

Eliminating higher-multiplicity intersections. III. Codimension 2Hanani--Tutte and Hierarchical Partial PlanarityAdvances on Testing C-Planarity of Embedded Flat Clustered GraphsOn the number of edges of separated multigraphsAtomic Embeddability, Clustered Planarity, and ThickenabilityClustered planarity with pipesSynchronized Planarity with Applications to Constrained Planarity ProblemsOn the complexity of the storyplan problemClustered planarity testing revisitedOn the complexity of the storyplan problemHanani-Tutte for radial planarity. IISmall Point-Sets Supporting Graph StoriesA Direct Proof of the Strong Hanani–Tutte Theorem on the Projective PlaneHanani-Tutte for Radial Planarity IISimultaneous Orthogonal PlanaritySmall point-sets supporting graph storiesArrangements of pseudocircles: on digons and trianglesThe QuaSEFE problemClustered planarity = flat clustered planaritySimpler algorithms for testing two-page book embedding of partitioned graphsSimultaneous embedding: edge orderings, relative positions, cutverticesStrip planarity testing for embedded planar graphsUnnamed ItemHanani-Tutte for approximating maps of graphsThe importance of being properDrawing Simultaneously Embedded Graphs with Few BendsC-planarity testing of embedded clustered graphs with bounded dual carving-widthBounded Embeddings of Graphs in the PlaneOrthogonal planarity testing of bounded treewidth graphsBeyond Clustered Planar GraphsSimultaneous EmbeddingAdvancements on SEFE and partitioned book embedding problems




This page was built for publication: Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants