Simple Realizability of Complete Abstract Topological Graphs Simplified

DOI10.1007/978-3-319-27261-0_26zbMath1471.68201arXiv1608.05867OpenAlexW2401620820MaRDI QIDQ2959766

Jan Kynčl

Publication date: 10 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.05867

Mathematics Subject Classification ID

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) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings ⋮ Topological Drawings of Complete Bipartite Graphs ⋮ Extending simple drawings ⋮ Closing in on Hill's Conjecture ⋮ Quantitative Restrictions on Crossing Patterns ⋮ On the Maximum Number of Crossings in Star-Simple Drawings of $$K_n$$ with No Empty Lens

This page was built for publication: Simple Realizability of Complete Abstract Topological Graphs Simplified