Overlapping Cluster Planarity

DOI10.7155/JGAA.00167MaRDI QIDQ5301438zbMATH OpenOpenAlexWikidataFDO

Authors Walter Didimo, Francesco Giordano, Giuseppe Liotta

Publication date 19 January 2009

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://www.emis.de/journals/JGAA/accepted/2008/DidimoGiordanoLiotta2008.12.3.pdf

zbMATH Keywords

vertex clusters

Mathematics Subject Classification ID

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

Recommendations

• Planarity of Overlapping Clusterings Including Unions of Two Partitions
• Planarity for clustered graphs
• A new perspective on clustered planarity as a combinatorial embedding problem
• A new perspective on clustered planarity as a combinatorial embedding problem
• \((k, p)\)-planarity: a relaxation of hybrid planarity

Cited in

(9)

• Subdivision Drawings of Hypergraphs
• Planarity of Overlapping Clusterings Including Unions of Two Partitions
• Clustered Planarity with Pipes
• \((k, p)\)-planarity: a relaxation of hybrid planarity
• The role of twins in computing planar supports of hypergraphs
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• \((k,p)\)-planarity: a relaxation of hybrid planarity
• Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
• Advances on testing C-planarity of embedded flat clustered graphs

This page was built for publication: Overlapping Cluster Planarity

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