Clustered Planarity: Small Clusters in Eulerian Graphs
DOI10.1007/978-3-540-77537-9_30zbMATH Open1137.68495OpenAlexW205631779MaRDI QIDQ5452233FDOQ5452233
Authors: Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondřej Suchý, Tomáš Vyskočil 
Publication date: 25 March 2008
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_30
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
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (18)
- Splitting clusters to get c-planarity
- Planarity for clustered graphs
- Planarity of Overlapping Clusterings Including Unions of Two Partitions
- Relaxing the constraints of clustered planarity
- Computing Maximum C-Planar Subgraphs
- Clustered planarity: small clusters in cycles and Eulerian graphs
- Clustered Planarity: Clusters with Few Outgoing Edges
- Graph Drawing
- Clustered Planarity with Pipes
- Title not available (Why is that?)
- Graph Drawing
- Clustered planarity testing revisited
- Title not available (Why is that?)
- Clustered planarity with pipes
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- A note on obstructions to clustered planarity
- Shrinking the search space for clustered planarity
- Straight-Line Rectangular Drawings of Clustered Graphs
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)
