The crossing number of a graph G is the least number of crossings over all possible drawings of G. We present a structural characterization of graphs with crossing number one
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the p...
The crossing number of a graph G=(V,E), denoted by cr(G), is the smallest number of edge crossings i...
The crossing number, cr(G), of a graph G is the least number of cross-ing points in any drawing of G...
The crossing number of a graph G is the least number of crossings over all possible drawings of G. W...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the p...
AbstractWe show that if G is a graph minimal with respect to having crossing number at least k, and ...
In this paper we present a branch-and-bound algorithm for finding the minimum crossing number of a g...
AbstractIt is easily seen that. for each k, there is a graph G whose crossing number is at least k a...
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of t...
AbstractThe nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in ...
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a g...
The crossing number \cn(G) of a graph G is the minimum number of crossings over all drawings of G in...
AbstractIn this paper we obtain a combinatorial lower bound δg(G) for the crossing number crg(G) of ...
The crossing number CR() of a graph =(,) is the smallest number of edge crossings over all drawi...
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the p...
The crossing number of a graph G=(V,E), denoted by cr(G), is the smallest number of edge crossings i...
The crossing number, cr(G), of a graph G is the least number of cross-ing points in any drawing of G...
The crossing number of a graph G is the least number of crossings over all possible drawings of G. W...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the p...
AbstractWe show that if G is a graph minimal with respect to having crossing number at least k, and ...
In this paper we present a branch-and-bound algorithm for finding the minimum crossing number of a g...
AbstractIt is easily seen that. for each k, there is a graph G whose crossing number is at least k a...
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of t...
AbstractThe nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in ...
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a g...
The crossing number \cn(G) of a graph G is the minimum number of crossings over all drawings of G in...
AbstractIn this paper we obtain a combinatorial lower bound δg(G) for the crossing number crg(G) of ...
The crossing number CR() of a graph =(,) is the smallest number of edge crossings over all drawi...
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the p...
The crossing number of a graph G=(V,E), denoted by cr(G), is the smallest number of edge crossings i...
The crossing number, cr(G), of a graph G is the least number of cross-ing points in any drawing of G...
DOI
Add to ORKG