An upper bound for the rectilinear crossing number of the complete graph
From MaRDI portal
Publication:2545098
DOI10.1016/0095-8956(71)90045-1zbMath0213.50701OpenAlexW2069888750MaRDI QIDQ2545098
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(71)90045-1
Related Items (9)
NETPAD: An interactive graphics system for network modeling and optimization ⋮ Geometric drawings of \(K_{n}\) with few crossings ⋮ Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs ⋮ An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants ⋮ A successful concept for measuring non-planarity of graphs: The crossing number. ⋮ Weighted Turán problems with applications ⋮ A lower bound for the rectilinear crossing number ⋮ Which crossing number is it anyway? ⋮ On the crossing number of complete graphs
Cites Work
This page was built for publication: An upper bound for the rectilinear crossing number of the complete graph