In this paper, we establish the crossing number of join product of 5-wheel with n isolated vertices. In addition, the exact values for the crossing numbers of Cartesian products of the wheels of order at most five with any tree T are given
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at mos...
AbstractThe exact crossing number is known only for a few specific families of graphs. Cartesian pro...
AbstractUsing a newly introduced operation on graphs and its counterpart on graph drawings, we prove...
Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two ar...
The exact values of crossing numbers of the Cartesian products of four special graphs of order five ...
There are several known exact results on the crossing numbers of Cartesian products of paths, cycles...
The main aim of the paper is to establish the crossing numbers of the join products of the paths and...
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at mos...
The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of ...
There are only few results concerning crossing numbers of join of some graphs. In this paper, for so...
The main aim of the paper is to give the crossing number of join product G+Dn for the disconnected g...
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at mos...
There are several known exact results on the crossing number of Cartesian products of paths, cycles,...
The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in ...
Since Harary, Kainen and Schwenk conjectured in 1973 that the crossing number of the Cartesian produ...
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at mos...
AbstractThe exact crossing number is known only for a few specific families of graphs. Cartesian pro...
AbstractUsing a newly introduced operation on graphs and its counterpart on graph drawings, we prove...
Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two ar...
The exact values of crossing numbers of the Cartesian products of four special graphs of order five ...
There are several known exact results on the crossing numbers of Cartesian products of paths, cycles...
The main aim of the paper is to establish the crossing numbers of the join products of the paths and...
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at mos...
The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of ...
There are only few results concerning crossing numbers of join of some graphs. In this paper, for so...
The main aim of the paper is to give the crossing number of join product G+Dn for the disconnected g...
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at mos...
There are several known exact results on the crossing number of Cartesian products of paths, cycles,...
The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in ...
Since Harary, Kainen and Schwenk conjectured in 1973 that the crossing number of the Cartesian produ...
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at mos...
AbstractThe exact crossing number is known only for a few specific families of graphs. Cartesian pro...
AbstractUsing a newly introduced operation on graphs and its counterpart on graph drawings, we prove...
DOI
Add to ORKG