Splitting clusters to get c-planarity

DOI10.1007/978-3-642-11805-0_8MaRDI QIDQ3557871zbMATH OpenOpenAlexFDO

Authors Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani

Publication date 27 April 2010

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11805-0_8

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1974122
• Clustered Planarity: Small Clusters in Eulerian Graphs
• C-Planarity of C-Connected Clustered Graphs
• Clustered planarity: small clusters in cycles and Eulerian graphs

Cited in

(5)

• Clustered planarity = flat clustered planarity
• Relaxing the constraints of clustered planarity
• Clustered planarity with pipes
• Planarity of Overlapping Clusterings Including Unions of Two Partitions
• Advances on testing C-planarity of embedded flat clustered graphs

This page was built for publication: Splitting clusters to get c-planarity

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