Clustered Planarity: Clusters with Few Outgoing Edges

DOI10.1007/978-3-642-00219-9_11zbMath1213.68460MaRDI 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

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

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

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