The Rectilinear Crossing Number of K n : Closing in (or Are We?)
DOI10.1007/978-1-4614-0110-0_2zbMath1272.05029OpenAlexW149069588MaRDI QIDQ2849795
Silvia Fernández-Merchant, Gelasio Salazar, Bernardo M. Ábrego
Publication date: 25 September 2013
Published in: Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0110-0_2
Geometric probability and stochastic geometry (60D05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Erd?s problems and related topics of discrete geometry (52C10) Graph representations (geometric and intersection representations, etc.) (05C62) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Combinatorial complexity of geometric structures (52C45)
Related Items (14)
This page was built for publication: The Rectilinear Crossing Number of K n : Closing in (or Are We?)