scientific article; zbMATH DE number 2086693

zbMath1058.05057MaRDI QIDQ4737230

Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23801043.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

planar graphsgraph drawing algorithmsWagner's theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On \(k\)-greedy routing algorithms ⋮ Watermelon uniform random generation with applications ⋮ Drawing Planar Graphs on Area ⋮ Drawing Planar Graphs with Few Geometric Primitives ⋮ Improved floor-planning of graphs via adjacency-preserving transformations ⋮ Drawing planar graphs with few segments on a polynomial grid ⋮ Orthogonal drawings based on the stratification of planar graphs ⋮ Improved visibility representation of plane graphs ⋮ Planar graphs, via well-orderly maps and trees ⋮ On Planar Polyline Drawings ⋮ Sampling and Counting 3-Orientations of Planar Triangulations ⋮ Drawing Planar Graphs with Reduced Height ⋮ Visibility representation of plane graphs via canonical ordering tree ⋮ A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths