Embedding Graphs into Embedded Graphs

DOI10.4230/LIPICS.ISAAC.2017.34zbMath1457.68214OpenAlexW2963862502MaRDI QIDQ5136253

Radoslav Fulek

Publication date: 25 November 2020

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8223/pdf/LIPIcs-ISAAC-2017-34.pdf/

zbMATH Keywords

graph embeddingweakly simple polygonsc-planarity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Clustered planarity = flat clustered planarity ⋮ Stability of intersections of graphs in the plane and the van Kampen obstruction ⋮ Hanani-Tutte for approximating maps of graphs ⋮ Beyond Clustered Planar Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strip planarity testing for embedded planar graphs
• Clustered planarity testing revisited
• On embedding a cycle in a plane graph
• On approximability by embeddings of cycles in the plane.
• \(c\)-planarity of embedded cyclic \(c\)-graphs
• On separating two simple polygons by a single translation
• Unified Hanani-Tutte theorem
• Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
• A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
• Recognizing weakly simple polygons
• Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
• Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
• Clustered Planarity with Pipes
• C-Planarity of C-Connected Clustered Graphs
• Detecting Weakly Simple Polygons
• Realization of mappings
• Graph Drawing
• Planarity for clustered graphs

This page was built for publication: Embedding Graphs into Embedded Graphs