DOIAbstract
AbstractThe crossing number of the Cartesian product C3 × Cn of a 3-cycle and an n-cycle is shown to be n
AbstractThe crossing number of the Cartesian product C3 × Cn of a 3-cycle and an n-cycle is shown to be n
Using a newly introduced operation on graphs and its counterpart on graph drawings, we prove the con...
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at mos...
AbstractThere are known several exact results on the crossing numbers of Cartesian products of cycle...
AbstractThe crossing number of the Cartesian product C3 × Cn of a 3-cycle and an n-cycle is shown to...
Since Harary, Kainen and Schwenk conjectured in 1973 that the crossing number of the Cartesian produ...
We prove that the crossing number of the cartesian product of 2 cycles, C_{m} \times C_{n}, m \le n,...
AbstractThe exact crossing number is known only for a few specific families of graphs. Cartesian pro...
AbstractThere are several known exact results on the crossing numbers of Cartesian products of paths...
AbstractMotivated by the problem of determining the crossing number of the Cartesian product Cm×Cn o...
AbstractMotivated by the problem of determining the crossing number of the Cartesian product Cm×Cn o...
AbstractA long-standing conjecture states that the crossing number of the Cartesian product of cycle...
Abstract. The minimum number of crossings for all drawings of a given graph G on a plane is called i...
AbstractIn this paper, we prove that the crossing number of the complete tripartite graph K1,4,n is ...
There are several known exact results on the crossing number of Cartesian products of paths, cycles,...
The exact values of crossing numbers of the Cartesian products of four special graphs of order five ...
Using a newly introduced operation on graphs and its counterpart on graph drawings, we prove the con...
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at mos...
AbstractThere are known several exact results on the crossing numbers of Cartesian products of cycle...
AbstractThe crossing number of the Cartesian product C3 × Cn of a 3-cycle and an n-cycle is shown to...
Since Harary, Kainen and Schwenk conjectured in 1973 that the crossing number of the Cartesian produ...
We prove that the crossing number of the cartesian product of 2 cycles, C_{m} \times C_{n}, m \le n,...
AbstractThe exact crossing number is known only for a few specific families of graphs. Cartesian pro...
AbstractThere are several known exact results on the crossing numbers of Cartesian products of paths...
AbstractMotivated by the problem of determining the crossing number of the Cartesian product Cm×Cn o...
AbstractMotivated by the problem of determining the crossing number of the Cartesian product Cm×Cn o...
AbstractA long-standing conjecture states that the crossing number of the Cartesian product of cycle...
Abstract. The minimum number of crossings for all drawings of a given graph G on a plane is called i...
AbstractIn this paper, we prove that the crossing number of the complete tripartite graph K1,4,n is ...
There are several known exact results on the crossing number of Cartesian products of paths, cycles,...
The exact values of crossing numbers of the Cartesian products of four special graphs of order five ...
Using a newly introduced operation on graphs and its counterpart on graph drawings, we prove the con...
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at mos...
AbstractThere are known several exact results on the crossing numbers of Cartesian products of cycle...
Add to ORKG