scientific article; zbMATH DE number 1974122
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
How to draw the minimum cuts of a planar graph, Straight-Line Rectangular Drawings of Clustered Graphs, Advances on Testing C-Planarity of Embedded Flat Clustered Graphs, Atomic Embeddability, Clustered Planarity, and Thickenability, Drawing \(c\)-planar biconnected clustered graphs, Synchronized Planarity with Applications to Constrained Planarity Problems, Clustered planarity testing revisited, A new perspective on clustered planarity as a combinatorial embedding problem, \(c\)-planarity of embedded cyclic \(c\)-graphs, Straight-line rectangular drawings of clustered graphs, Embedding graphs into embedded graphs, Completely connected clustered graphs, Simpler algorithms for testing two-page book embedding of partitioned graphs, Relaxing the constraints of clustered planarity, Hanani-Tutte for approximating maps of graphs, Clustered Planarity: Clusters with Few Outgoing Edges, Computing Maximum C-Planar Subgraphs, Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters, C-planarity testing of embedded clustered graphs with bounded dual carving-width, On embedding a cycle in a plane graph, Bounded Embeddings of Graphs in the Plane, Beyond Clustered Planar Graphs, Embedding Graphs into Embedded Graphs
