An upper bound for the rectilinear crossing number of the complete graph
From MaRDI portal
Publication:2545098
DOI10.1016/0095-8956(71)90045-1zbMath0213.50701MaRDI 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
05C99: Graph theory
Related Items
On the crossing number of complete graphs, Geometric drawings of \(K_{n}\) with few crossings, A successful concept for measuring non-planarity of graphs: The crossing number., Which crossing number is it anyway?, NETPAD: An interactive graphics system for network modeling and optimization, A lower bound for the rectilinear crossing number
Cites Work