DOIAbstract
AbstractAn algebraic structure, related to the crossing number, is constructed from a given graph
AbstractAn algebraic structure, related to the crossing number, is constructed from a given graph
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph i...
The well known Zarankiewicz ’ conjecture is said that the crossing number of the complete bipartite ...
This paper is an exposition of two main results regarding the upper bounds of the crossing numbers o...
AbstractAn algebraic structure, related to the crossing number, is constructed from a given graph
AbstractThis paper surveys how the concept of crossing number, which used to be familiar only to a l...
In this paper we present a branch-and-bound algorithm for finding the minimum crossing number of a g...
The crossing number of a graph G is the least number of crossings over all possible drawings of G. W...
The main objective of this workshop is to bring together two groups of researchers, those working in...
We give a survey of recent techniques for deriving lower bounds and algorithms for constructing uppe...
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a g...
Since Harary, Kainen and Schwenk conjectured in 1973 that the crossing number of the Cartesian produ...
AbstractThe crossing number of a graph is the minimum number of edge crossings in any drawing of the...
AbstractThe nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in ...
A drawing of a graph is pseudolinear if there is a pseudoline arrangement such that each pseudoline ...
The crossing number of a graph G, cr(G) is the minimum number of intersections among edges over all ...
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph i...
The well known Zarankiewicz ’ conjecture is said that the crossing number of the complete bipartite ...
This paper is an exposition of two main results regarding the upper bounds of the crossing numbers o...
AbstractAn algebraic structure, related to the crossing number, is constructed from a given graph
AbstractThis paper surveys how the concept of crossing number, which used to be familiar only to a l...
In this paper we present a branch-and-bound algorithm for finding the minimum crossing number of a g...
The crossing number of a graph G is the least number of crossings over all possible drawings of G. W...
The main objective of this workshop is to bring together two groups of researchers, those working in...
We give a survey of recent techniques for deriving lower bounds and algorithms for constructing uppe...
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a g...
Since Harary, Kainen and Schwenk conjectured in 1973 that the crossing number of the Cartesian produ...
AbstractThe crossing number of a graph is the minimum number of edge crossings in any drawing of the...
AbstractThe nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in ...
A drawing of a graph is pseudolinear if there is a pseudoline arrangement such that each pseudoline ...
The crossing number of a graph G, cr(G) is the minimum number of intersections among edges over all ...
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph i...
The well known Zarankiewicz ’ conjecture is said that the crossing number of the complete bipartite ...
This paper is an exposition of two main results regarding the upper bounds of the crossing numbers o...
Add to ORKG