Add to ORKGThe well known Zarankiewicz ’ conjecture is said that the crossing number of the complete bipartite graph Km,n (m ≤ n) is Z(m, n), where Z(m, n) = ⌊ m 2 ⌊ n−
AbstractInvestigation of the crossing number of graphs is a classical but very difficult problem. Th...
AbstractIn this paper we obtain a combinatorial lower bound δg(G) for the crossing number crg(G) of ...
This survey concentrates on selected theoretical and computational aspects of the crossing number of...
AbstractA longstanding problem of crossing number, Zarankiewicz’s conjecture, asserts that the cross...
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar ...
It has been long conjectured that the crossing number cr(Km,n) of the complete bipartite graph Km,n ...
This paper is an exposition of two main results regarding the upper bounds of the crossing numbers o...
In this paper, we determine the crossing number of the complete tripartite graph K1,5,n for any inte...
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar ...
AbstractIn this paper, we prove that the crossing number of the complete tripartite graph K1,4,n is ...
AbstractIt is shown that the toroidal crossing number of the complete bipartite graph, Km, n, lies b...
It has been long conjectured by Zarankiewicz, the crossing number of the complete bipartite graph Km...
It has been long conjectured by Zarankiewicz, the crossing number of the complete bipartite graph Km...
AbstractThe toroidal crossing number of the complete graph on n points is shown to lie between23210(...
Since Harary, Kainen and Schwenk conjectured in 1973 that the crossing number of the Cartesian produ...
AbstractInvestigation of the crossing number of graphs is a classical but very difficult problem. Th...
AbstractIn this paper we obtain a combinatorial lower bound δg(G) for the crossing number crg(G) of ...
This survey concentrates on selected theoretical and computational aspects of the crossing number of...
AbstractA longstanding problem of crossing number, Zarankiewicz’s conjecture, asserts that the cross...
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar ...
It has been long conjectured that the crossing number cr(Km,n) of the complete bipartite graph Km,n ...
This paper is an exposition of two main results regarding the upper bounds of the crossing numbers o...
In this paper, we determine the crossing number of the complete tripartite graph K1,5,n for any inte...
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar ...
AbstractIn this paper, we prove that the crossing number of the complete tripartite graph K1,4,n is ...
AbstractIt is shown that the toroidal crossing number of the complete bipartite graph, Km, n, lies b...
It has been long conjectured by Zarankiewicz, the crossing number of the complete bipartite graph Km...
It has been long conjectured by Zarankiewicz, the crossing number of the complete bipartite graph Km...
AbstractThe toroidal crossing number of the complete graph on n points is shown to lie between23210(...
Since Harary, Kainen and Schwenk conjectured in 1973 that the crossing number of the Cartesian produ...
AbstractInvestigation of the crossing number of graphs is a classical but very difficult problem. Th...
AbstractIn this paper we obtain a combinatorial lower bound δg(G) for the crossing number crg(G) of ...
This survey concentrates on selected theoretical and computational aspects of the crossing number of...