1 paper
Qingqin Wu, Yiqiao Wang
A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. A graph is k-degenerate if each of its subgraphs contains a vertex of…