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
AbstractUpper and lower bounds for the crossing number of the graph formed by deletion of a hamilton...
AbstractCycle drawings of Kn use edges either inside or outside of a convex n-gon. The smallest n su...
This survey concentrates on selected theoretical and computational aspects of the crossing number of...
AbstractIt is shown that cr(Kn)⩽7n4 − 56n3 + 128n2 + 48nn − 73 + 108432 where cr(Kn) is the rectilin...
AbstractScheinerman and Wilf (Amer. Math. Monthly 101 (1994) 939) assert that “an important open pro...
AbstractWe give a new upper bound for the rectilinear crossing number cr¯(n) of the complete geometr...
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 ...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
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...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
AbstractThe toroidal crossing number of the complete graph on n points is shown to lie between23210(...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
AbstractUpper and lower bounds for the crossing number of the graph formed by deletion of a hamilton...
AbstractCycle drawings of Kn use edges either inside or outside of a convex n-gon. The smallest n su...
This survey concentrates on selected theoretical and computational aspects of the crossing number of...
AbstractIt is shown that cr(Kn)⩽7n4 − 56n3 + 128n2 + 48nn − 73 + 108432 where cr(Kn) is the rectilin...
AbstractScheinerman and Wilf (Amer. Math. Monthly 101 (1994) 939) assert that “an important open pro...
AbstractWe give a new upper bound for the rectilinear crossing number cr¯(n) of the complete geometr...
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 ...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
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...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane ...
AbstractThe toroidal crossing number of the complete graph on n points is shown to lie between23210(...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
AbstractUpper and lower bounds for the crossing number of the graph formed by deletion of a hamilton...
AbstractCycle drawings of Kn use edges either inside or outside of a convex n-gon. The smallest n su...
This survey concentrates on selected theoretical and computational aspects of the crossing number of...
DOI
Add to ORKG