Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters

DOI10.1007/978-3-642-00219-9_13MaRDI QIDQ3611846zbMATH OpenOpenAlexFDO

Authors Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický

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_13

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Clustered Planarity: Small Clusters in Eulerian Graphs
• Clustering Cycles into Cycles of Clusters
• Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
• Graph Drawing
• Graph Drawing
• scientific article; zbMATH DE number 1189242 (Why is no real title available?)
• scientific article; zbMATH DE number 1974122 (Why is no real title available?)
• Planarity for clustered graphs
• Subgraph induced planar connectivity augmentation (extended abstract)

Cited in

(20)

• Clustered planarity = flat clustered planarity
• Planarity-preserving clustering and embedding for large planar graphs
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Embedding graphs into embedded graphs
• Relaxing the constraints of clustered planarity
• Clustered planarity with pipes
• Bounded Embeddings of Graphs in the Plane
• scientific article; zbMATH DE number 1500683 (Why is no real title available?)
• Beyond Clustered Planar Graphs
• Hanani-Tutte for approximating maps of graphs
• Embedding Graphs into Embedded Graphs
• Strip planarity testing for embedded planar graphs
• Planarity of Overlapping Clusterings Including Unions of Two Partitions
• Advances on testing C-planarity of embedded flat clustered graphs
• Clustered Planarity: Small Clusters in Eulerian Graphs
• Graph Drawing
• Correlation clustering and two-edge-connected augmentation for planar graphs
• Straight-line rectangular drawings of clustered graphs
• Exact algorithms for clustered planarity with linear saturators
• A new perspective on clustered planarity as a combinatorial embedding problem

This page was built for publication: Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters

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