An upper bound for the rectilinear crossing number of the complete graph
- 1 June 1971
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 10 (3) , 212-216
- https://doi.org/10.1016/0095-8956(71)90045-1
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- The crossing number of K5,nJournal of Combinatorial Theory, 1970
- On a problem of P. ErdösJournal of Combinatorial Theory, 1968