A characterization of planar graphs by pseudo-line arrangements

DOI10.1007/s00453-002-0999-9zbMath1045.68106OpenAlexW2067893166MaRDI QIDQ1400888

Takeshi Tokuyama, Hisao Tamaki

Publication date: 17 August 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0999-9

zbMATH Keywords

Planar graph\(k\)-level complexityGeometric graph theoryPseudo-line arrangement

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (5)

On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) ⋮ Equitable subdivisions within polygonal regions ⋮ On the complexity of the \(k\)-level in arrangements of pseudoplanes ⋮ Unnamed Item ⋮ The maximum-level vertex in an arrangement of lines

This page was built for publication: A characterization of planar graphs by pseudo-line arrangements