Clustered Planarity: Small Clusters in Eulerian Graphs
From MaRDI portal
Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
- Clustered planarity: small clusters in cycles and Eulerian graphs
- Planarity for clustered graphs
- scientific article; zbMATH DE number 2084266
- Beyond Clustered Planar Graphs
- scientific article; zbMATH DE number 26490
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- C-Planarity of C-Connected Clustered Graphs
- Graph Drawing
- Clustered Planarity: Clusters with Few Outgoing Edges
- A new perspective on clustered planarity as a combinatorial embedding problem
Cited in
(18)- Relaxing the constraints of clustered planarity
- Clustered planarity with pipes
- scientific article; zbMATH DE number 2084266 (Why is no real title available?)
- Straight-Line Rectangular Drawings of Clustered Graphs
- Clustered planarity: small clusters in cycles and Eulerian graphs
- Splitting clusters to get c-planarity
- Clustered Planarity: Clusters with Few Outgoing Edges
- Computing Maximum C-Planar Subgraphs
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- scientific article; zbMATH DE number 1974122 (Why is no real title available?)
- Clustered Planarity with Pipes
- Shrinking the search space for clustered planarity
- Planarity of Overlapping Clusterings Including Unions of Two Partitions
- Graph Drawing
- Graph Drawing
- Planarity for clustered graphs
- A note on obstructions to clustered planarity
- Clustered planarity testing revisited
This page was built for publication: Clustered Planarity: Small Clusters in Eulerian Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452233)
