Completely connected clustered graphs

DOI10.1016/J.JDA.2005.06.002MaRDI QIDQ2458931zbMATH OpenOpenAlexFDO

Authors Sabine Cornelsen, Dorothea Wagner

Publication date 5 November 2007

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2005.06.002

zbMATH Keywords

planar drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Completely connected clustered graphs.
• scientific article; zbMATH DE number 1974122
• Drawing \(c\)-planar biconnected clustered graphs
• A new perspective on clustered planarity as a combinatorial embedding problem
• Graph Drawing

Cites work

• scientific article; zbMATH DE number 2084266 (Why is no real title available?)
• scientific article; zbMATH DE number 1189242 (Why is no real title available?)
• scientific article; zbMATH DE number 177556 (Why is no real title available?)
• scientific article; zbMATH DE number 1974122 (Why is no real title available?)
• scientific article; zbMATH DE number 1974123 (Why is no real title available?)
• Completely connected clustered graphs.
• Drawing Clustered Graphs on an Orthogonal Grid
• Graph Drawing
• Graph drawing. 10th international symposium, GD 2002, Irvine, CA, USA, August 26--28, 2002. Revised papers
• How to draw the minimum cuts of a planar graph
• Planarity for clustered graphs
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs

Cited in

(14)

• Straight-line rectangular drawings of clustered graphs
• Clustered planarity = flat clustered planarity
• Relaxing the constraints of clustered planarity
• Convex drawings of hierarchical planar graphs and clustered planar graphs
• Computing Maximum C-Planar Subgraphs
• Clustered Planarity: Clusters with Few Outgoing Edges
• Simpler algorithms for testing two-page book embedding of partitioned graphs
• Beyond Clustered Planar Graphs
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Completely connected clustered graphs.
• Drawing \(c\)-planar biconnected clustered graphs
• A new perspective on clustered planarity as a combinatorial embedding problem
• Straight-Line Rectangular Drawings of Clustered Graphs
• Advances on testing C-planarity of embedded flat clustered graphs

This page was built for publication: Completely connected clustered graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458931)