scientific article; zbMATH DE number 1189242

MaRDI QIDQ3839007zbMATH OpenFDO

Authors Elias Dahlhaus

Publication date 14 January 1999

zbMATH Keywords

algorithmclustered planar of graphsplanar embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Planarity for clustered graphs
• scientific article; zbMATH DE number 2084266
• C-Planarity of C-Connected Clustered Graphs
• scientific article; zbMATH DE number 1974122
• Drawing Clustered Graphs on an Orthogonal Grid

Cited in

(16)

• On embedding a cycle in a plane graph
• Clustered planarity = flat clustered planarity
• How to draw the minimum cuts of a planar graph
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Relaxing the constraints of clustered planarity
• Completely connected clustered graphs
• Straight-Line Rectangular Drawings of Clustered Graphs
• Clustered Planarity: Clusters with Few Outgoing Edges
• Computing Maximum C-Planar Subgraphs
• Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
• Beyond Clustered Planar Graphs
• Advances on testing C-planarity of embedded flat clustered graphs
• Straight-line rectangular drawings of clustered graphs
• Constrained planarity in practice -- engineering the synchronized planarity algorithm
• Drawing \(c\)-planar biconnected clustered graphs
• A new perspective on clustered planarity as a combinatorial embedding problem

This page was built for publication:

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