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 ...
This is a preview. Log in through your library . Abstract This paper is mainly concerned with the realizability of a set of n integers as the degrees of vertices of an n-vertex linear graph. Other ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback