AbstractIt is shown that cr(Kn)⩽7n4 − 56n3 + 128n2 + 48nn − 73 + 108432 where cr(Kn) is the rectilinear crossing number of the complete graph, Kn, by constructing, in the plane, a drawing, Dn, of Kn with the given number of intersections of pairs of edges
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar ...
AbstractWe give a new upper bound for the rectilinear crossing number cr¯(n) of the complete geometr...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
AbstractWe give a new upper bound for the rectilinear crossing number cr¯(n) of the complete geometr...
AbstractIt is shown that cr(Kn)⩽7n4 − 56n3 + 128n2 + 48nn − 73 + 108432 where cr(Kn) is the rectilin...
We give a new lower bound for the rectilinear crossing number cr(n) of the complete geometric graph ...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
We prove a lower bound of 0.3288 n 4¡for the rectilinear crossing number cr(Kn) of a complete graph ...
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar ...
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all str...
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all str...
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all str...
We prove that the maximum rectilinear crossing number of the Petersen graph is 49. First, we illustr...
We prove that the maximum rectilinear crossing number of the Petersen graph is 49. First, we illustr...
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar ...
AbstractWe give a new upper bound for the rectilinear crossing number cr¯(n) of the complete geometr...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
AbstractWe give a new upper bound for the rectilinear crossing number cr¯(n) of the complete geometr...
AbstractIt is shown that cr(Kn)⩽7n4 − 56n3 + 128n2 + 48nn − 73 + 108432 where cr(Kn) is the rectilin...
We give a new lower bound for the rectilinear crossing number cr(n) of the complete geometric graph ...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
We prove a lower bound of 0.3288 n 4¡for the rectilinear crossing number cr(Kn) of a complete graph ...
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar ...
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all str...
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all str...
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all str...
We prove that the maximum rectilinear crossing number of the Petersen graph is 49. First, we illustr...
We prove that the maximum rectilinear crossing number of the Petersen graph is 49. First, we illustr...
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar ...
AbstractWe give a new upper bound for the rectilinear crossing number cr¯(n) of the complete geometr...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
DOI
Add to ORKG