C-Planarity of C-Connected Clustered Graphs
From MaRDI portal
Publication:5301436
DOI10.7155/JGAA.00165zbMATH Open1161.68649OpenAlexW2100766141MaRDI QIDQ5301436FDOQ5301436
Authors: Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia 
Publication date: 19 January 2009
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/JGAA/accepted/2008/Cortese+2008.12.2.pdf
Recommendations
- scientific article; zbMATH DE number 1974122
- Efficient \(C\)-planarity testing for embedded flat clustered graphs with small faces
- Planarity for clustered graphs
- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
- A new perspective on clustered planarity as a combinatorial embedding problem
Cited In (25)
- Straight-line rectangular drawings of clustered graphs
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
- Clustered planarity = flat clustered planarity
- Splitting clusters to get c-planarity
- Relaxing the constraints of clustered planarity
- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
- Efficient \(C\)-planarity testing for embedded flat clustered graphs with small faces
- Clustered Planarity: Clusters with Few Outgoing Edges
- Embedding Graphs into Embedded Graphs
- Computing NodeTrix Representations of Clustered Graphs
- Bounded Embeddings of Graphs in the Plane
- Beyond Clustered Planar Graphs
- Synchronized Planarity with Applications to Constrained Planarity Problems
- Title not available (Why is that?)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- Graph Drawing
- \(c\)-planarity of embedded cyclic \(c\)-graphs
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Clustered planarity testing revisited
- Clustered planarity with pipes
- Clustered Planarity: Small Clusters in Eulerian Graphs
- A note on obstructions to clustered planarity
- Embedding graphs into embedded graphs
- A new perspective on clustered planarity as a combinatorial embedding problem
- Straight-Line Rectangular Drawings of Clustered Graphs
This page was built for publication: C-Planarity of C-Connected Clustered Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301436)
