scientific article
From MaRDI portal
Publication:3839007
zbMath0905.05074MaRDI QIDQ3839007
Publication date: 14 January 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (15)
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 ⋮ Drawing \(c\)-planar biconnected clustered graphs ⋮ A new perspective on clustered planarity as a combinatorial embedding problem ⋮ Straight-line rectangular drawings of clustered graphs ⋮ Clustered planarity = flat clustered planarity ⋮ Completely connected clustered graphs ⋮ Relaxing the constraints of clustered planarity ⋮ 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 ⋮ Beyond Clustered Planar Graphs
This page was built for publication: