The main aim of the paper is to give the crossing number of the join product G*+Dn. The connected graph G* of order six is isomorphic to K3,3\e obtained by removing one edge from the complete bipartite graph K3,3, and the discrete graph Dn consists of n isolated vertices. The proofs were carried out with the help of several possible redrawings of the graph G* with respect to its many symmetries
There are several known exact results on the crossing number of Cartesian products of paths, cycles,...
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 minimal number of crossings over all drawings of G in ...
The main aim of the paper is to give the crossing number of join product G+Dn for the disconnected g...
The main aim of the paper is to establish the crossing numbers of the join products of the paths and...
AbstractThere are only few results concerning crossing numbers of join of some graphs. In the paper,...
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...
The main aim of the paper is to give the crossing number of join product G+Dn for the connected grap...
There are only few results concerning the crossing numbers of join of some graphs. In this paper, th...
There are only few results concerning crossing numbers of join of some graphs. In this paper, for so...
In the paper, the crossing number of the join product G*+Dn for the disconnected graph G* consisting...
Kulli and Muddebihal [V.R. Kulli, M.H. Muddebihal, Characterization of join graphs with crossing num...
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at mos...
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 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 minimal number of crossings over all drawings of G in ...
The main aim of the paper is to give the crossing number of join product G+Dn for the disconnected g...
The main aim of the paper is to establish the crossing numbers of the join products of the paths and...
AbstractThere are only few results concerning crossing numbers of join of some graphs. In the paper,...
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...
The main aim of the paper is to give the crossing number of join product G+Dn for the connected grap...
There are only few results concerning the crossing numbers of join of some graphs. In this paper, th...
There are only few results concerning crossing numbers of join of some graphs. In this paper, for so...
In the paper, the crossing number of the join product G*+Dn for the disconnected graph G* consisting...
Kulli and Muddebihal [V.R. Kulli, M.H. Muddebihal, Characterization of join graphs with crossing num...
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at mos...
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 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 minimal number of crossings over all drawings of G in ...
DOI
Add to ORKG