Embedding graphs into embedded graphs
From MaRDI portal
Publication:2205635
DOI10.1007/s00453-020-00725-3zbMath1457.68213arXiv1608.02087OpenAlexW3034609531MaRDI QIDQ2205635
Publication date: 21 October 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.02087
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strip planarity testing for embedded planar graphs
- Clustered planarity testing revisited
- A new perspective on clustered planarity as a combinatorial embedding problem
- Bipartite graphs, upward drawings, and planarity
- On embedding a cycle in a plane graph
- On approximability by embeddings of cycles in the plane.
- Recognizing weakly simple polygons
- \(c\)-planarity of embedded cyclic \(c\)-graphs
- On separating two simple polygons by a single translation
- Clustered planarity with pipes
- Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- Efficient Planarity Testing
- Recognizing Weak Embeddings of Graphs
- Hanani-Tutte for approximating maps of graphs
- Atomic Embeddability, Clustered Planarity, and Thickenability
- C-Planarity of C-Connected Clustered Graphs
- Detecting Weakly Simple Polygons
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
- Realization of mappings
- Graph Drawing
- Planarity for clustered graphs
