Recognizing Outer 1-Planar Graphs in Linear Time
From MaRDI portal
Publication:2867648
DOI10.1007/978-3-319-03841-4_10zbMath1406.68057OpenAlexW49135760MaRDI QIDQ2867648
Kathrin Hanauer, Daniel Neuwirth, Andreas Gleißner, Josef Reislhuber, Christian Bachmaier, Christopher Auer, Franz-Josef Brandenburg
Publication date: 20 December 2013
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03841-4_10
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Outer 1-planar graphs ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ The edge chromatic number of outer-1-planar graphs ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ Linear arboricity of outer-1-planar graphs ⋮ Testing Full Outer-2-planarity in Linear Time ⋮ Fan-planarity: properties and complexity
This page was built for publication: Recognizing Outer 1-Planar Graphs in Linear Time
