The skewness of a graph $G$, $sk(G)$, is the smallest number of edges that need to be removed from $G$ to make it planar. The crossing number of a graph $G$, $cr(G)$, is the minimum number of crossings over all possible drawings of $G$. There is minimal work concerning the relationship between skewness and crossing numbers. In this work, we first introduce an inequality relation for these two parameters, and then we construct infinitely many near-planar graphs such that the inequality is equal. In addition, we give a necessary and sufficient condition for a graph to have its skewness equal to the crossing number and characterize some special graphs with $sk(G)=cr(G)$.