Some new light subgraphs in the 1-planar graphs
Tao Wang · arXiv (Cornell University) · 2013
A graph is 1-planar if it can be drawn on the plane such that every edge cross at most one other edge. A connected graph H is strongly light in a family of graphs G, if there exists a constant λ, such that every graph in G contains a subgraph K isomorphic to H with degG(v) ≤ λ for all v ∈ V(K). In this paper, we present some strongly light subgraphs in the family of 1-planar graphs with minimum degree 7.