On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
From MaRDI portal
Publication:2936926
DOI10.1007/978-3-662-45803-7_17zbMath1426.68200arXiv1409.0461OpenAlexW1903431984MaRDI QIDQ2936926
Michael A. Bekos, Luca Grilli, Michael Kaufmann, Seok-Hee Hong, Sabine Cornelsen
Publication date: 7 January 2015
Published in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.0461
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
On RAC drawings of 1-planar graphs ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ Recognizing optimal 1-planar graphs in linear time ⋮ 1-fan-bundle-planar drawings of graphs ⋮ A linear-time algorithm for testing full outer-2-planarity ⋮ Testing gap \(k\)-planarity is NP-complete ⋮ On Aligned Bar 1-Visibility Graphs ⋮ Testing Full Outer-2-planarity in Linear Time ⋮ Fan-planarity: properties and complexity
This page was built for publication: On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
