Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
From MaRDI portal
Publication:2971387
DOI10.7155/jgaa.00398zbMath1358.05194MaRDI QIDQ2971387
Jan Kratochvíl, Martin Gronemann, Carla Binucci, Fabrizio Montecchiani, Karsten Klein, Walter Didimo, Markus Chimani, Ioannis. G. Tollis
Publication date: 5 April 2017
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00398
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Fan-Planar Graphs, 2-Layer k-Planar Graphs, Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity, On Layered Fan-Planar Graph Drawings, Simplifying Non-Simple Fan-Planar Drawings, 1-fan-bundle-planar drawings of graphs, Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar, The density of fan-planar graphs, Simplifying non-simple fan-planar drawings