Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
From MaRDI portal
Publication:3611846
DOI10.1007/978-3-642-00219-9_13zbMath1213.68459OpenAlexW1483918863MaRDI QIDQ3611846
Jan Kratochvíl, Vít Jelínek, Bernard Lidický, Eva Jelínková
Publication date: 3 March 2009
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_13
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (13)
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs ⋮ Clustered planarity with pipes ⋮ A new perspective on clustered planarity as a combinatorial embedding problem ⋮ \(c\)-planarity of embedded cyclic \(c\)-graphs ⋮ Straight-line rectangular drawings of clustered graphs ⋮ Embedding graphs into embedded graphs ⋮ Clustered planarity = flat clustered planarity ⋮ Strip planarity testing for embedded planar graphs ⋮ Relaxing the constraints of clustered planarity ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Bounded Embeddings of Graphs in the Plane ⋮ Beyond Clustered Planar Graphs ⋮ Embedding Graphs into Embedded Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Clustering Cycles into Cycles of Clusters
- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
- Clustered Planarity: Small Clusters in Eulerian Graphs
- Graph Drawing
- Graph Drawing
- Graph-Theoretic Concepts in Computer Science
- Planarity for clustered graphs
This page was built for publication: Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters