1 January 2021 in Opuscula Mathematica
The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. The main aim of the paper is to give the crossing number of the join product \(W_4+P_n\) and \(W_4+C_n\) for the wheel \(W_4\) on five vertices, where \(P_n\) and \(C_n\) are the path and the cycle on \(n\) vertices, respectively. Yue et al. conjectured that the crossing number of \(W_m+C_n\) is equal to \(Z(m+1)Z(n)+(Z(m)-1) \big \lfloor \frac{n}{2} \big \rfloor + n+ \big\lceil\frac{m}{2}\big\rceil +2\), for all \(m,n \geq 3\), and where the Zarankiewicz's number \(Z(n)=\big \lfloor \frac{n}{2} \big \rfloor \big \lfloor \frac{n-1}{2} \big \rfloor\) is defined for \(n\geq 1\). Recently, this conjecture was proved for \(W_3+C_n\) by Klešč. We establish the validity of this conjecture for \(W_4+C_n\) and we also offer a new conjecture for the crossing number of the join product \(W_m+P_n\) for \(m\geq 3\) and \(n\geq 2\).
1 December 2020 in Bulletin of the Australian Mathematical Society
A connected graph G is $\mathcal {CF}$ -connected if there is a path between every pair of vertices with no crossing on its edges for each optimal drawing of G. We conjecture that a complete bipartite graph $K_{m,n}$ is $\mathcal {CF}$ -connected if and only if it does not contain a subgraph of $K_{3,6}$ or $K_{4,4}$ . We establish the validity of this conjecture for all complete bipartite graphs $K_{m,n}$ for any $m,n$ with $\min \{m,n\}\leq 6$ , and conditionally for $m,n\geq 7$ on the assumption of Zarankiewicz’s conjecture that $\mathrm {cr}(K_{m,n})=\big \lfloor \frac {m}{2} \big \rfloor \big \lfloor \frac {m-1}{2} \big \rfloor \big \lfloor \frac {n}{2} \big \rfloor \big \lfloor \frac {n-1}{2} \big \rfloor $ .
24 October 2023 in Electronic Journal of Graph Theory and Applications
On the problems of CF-connected graphs
16 December 2025 in Applied Mathematics and Computation