On the crossing number of complete graphs
Computing, 2006 - Springer
Let (G) denote the rectilinear crossing number of a graph G. We determine (K 11)= 102 and
(K 12)= 153. Despite the remarkable hunt for crossing numbers of the complete graph K n …
(K 12)= 153. Despite the remarkable hunt for crossing numbers of the complete graph K n …
On the Crossing Number of Complete Graphs
O Aichholzer, F Aurenhammer, H Krasser - Computing, 2006 - dl.acm.org
Let**(G) denote the rectilinear crossing number of a graph G. We determine**(K 11)= 102
and**(K 12)= 153. Despite the remarkable hunt for crossing numbers of the complete graph …
and**(K 12)= 153. Despite the remarkable hunt for crossing numbers of the complete graph …
[引用][C] On the crossing number of complete graphs
O Aichholzer, F Aurenhammer, H Krasser - Computing, 2006 - graz.elsevierpure.com
On the crossing number of complete graphs — Graz University of Technology Skip to main
navigation Skip to search Skip to main content Graz University of Technology Home Graz …
navigation Skip to search Skip to main content Graz University of Technology Home Graz …
On the Crossing Number of Complete Graphs
O Aichholzer, F Aurenhammer… - Computing. Archives for …, 2006 - search.proquest.com
Let cr (G) denote the rectilinear crossing number of a graph G. We determine cr (K11)= 102
and cr (K12)= 153. Despite the remarkable hunt for crossing numbers of the complete graph …
and cr (K12)= 153. Despite the remarkable hunt for crossing numbers of the complete graph …
On the Crossing Number of Complete Graphs.
O Aichholzer, F Aurenhammer, H Krasser - Computing, 2006 - search.ebscohost.com
Let [InlineMediaObject not available: see fulltext.](G) denote the rectilinear crossing number
of a graph G. We determine [InlineMediaObject not available: see fulltext.](K< sub> 11)= 102 …
of a graph G. We determine [InlineMediaObject not available: see fulltext.](K< sub> 11)= 102 …
On the Crossing Number of Complete Graphs
O Aichholzer, F Aurenhammer, H Krasser - Computing, 2006 - infona.pl
Let (G) denote the rectilinear crossing number of a graph G. We determine (K 11)= 102 and
(K 12)= 153. Despite the remarkable hunt for crossing numbers of the complete graph K n …
(K 12)= 153. Despite the remarkable hunt for crossing numbers of the complete graph K n …
[引用][C] On the crossing number of complete graphs
O AICHHOLZER, F AURENHAMMER… - Computing (Wien …, 2006 - pascal-francis.inist.fr
On the crossing number of complete graphs CNRS Inist Pascal-Francis CNRS Pascal and
Francis Bibliographic Databases Simple search Advanced search Search by classification …
Francis Bibliographic Databases Simple search Advanced search Search by classification …