Graph crossing numbers quantify the minimum number of edge intersections in any planar drawing of a graph, an essential parameter in both theoretical and applied graph theory. The study of crossing ...
Carpathian Journal of Mathematics, Vol. 39, No. 2 (2023), pp. 371-382 (12 pages) The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. In ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback