Clustered Planarity: Clusters with Few Outgoing Edges

DOI10.1007/978-3-642-00219-9_11zbMath1213.68460OpenAlexW1496931397MaRDI QIDQ3611843

Vít Jelínek, Ondřej Suchý, Tomáš Vyskočil, Marek Tesař

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_11

Mathematics Subject Classification ID

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 (6)

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs ⋮ A new perspective on clustered planarity as a combinatorial embedding problem ⋮ Straight-line rectangular drawings of clustered graphs ⋮ Clustered planarity = flat clustered planarity ⋮ Relaxing the constraints of clustered planarity ⋮ Beyond Clustered Planar Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Completely connected clustered graphs
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Efficient Planarity Testing
• 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-Theoretic Concepts in Computer Science
• Planarity for clustered graphs

This page was built for publication: Clustered Planarity: Clusters with Few Outgoing Edges