Publication:4422278
From MaRDI portal
zbMath1037.68587MaRDI QIDQ4422278
Michael Jünger, Petra Mutzel, René Weiskircher, Sebastian Leipert, Carsten Gutwenger, Merijam Percan
Publication date: 3 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2528/25280220.htm
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs, Straight-line rectangular drawings of clustered graphs, Drawing \(c\)-planar biconnected clustered graphs, Clustered planarity testing revisited, A new perspective on clustered planarity as a combinatorial embedding problem, On embedding a cycle in a plane graph, \(c\)-planarity of embedded cyclic \(c\)-graphs, Simpler algorithms for testing two-page book embedding of partitioned graphs, How to draw the minimum cuts of a planar graph, Relaxing the constraints of clustered planarity, Completely connected clustered graphs, Bounded Embeddings of Graphs in the Plane, 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
