Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus

DOI10.7155/jgaa.00398zbMath1358.05194OpenAlexW2500153981MaRDI 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

zbMATH Keywords

2-layer fan-planar drawable graphs2-layer right-angle crossing graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (10)

The density of fan-planar graphs ⋮ Simplifying Non-Simple Fan-Planar Drawings ⋮ Simplifying non-simple fan-planar drawings ⋮ The family of fan-planar graphs ⋮ 1-fan-bundle-planar drawings of graphs ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar ⋮ On Layered Fan-Planar Graph Drawings ⋮ Fan-Planar Graphs ⋮ 2-Layer k-Planar Graphs

This page was built for publication: Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus