2000 character limit reached
Strongly light subgraphs in the 1-planar graphs with minimum degree 7
Published 25 Apr 2013 in math.CO and cs.DM | (1304.6896v2)
Abstract: A graph is {\em $1$-planar} if it can be drawn in the plane such that every edge crosses at most one other edge. A connected graph is {\em strongly light} in a family of graphs , if there exists a constant , such that every graph in contains a subgraph isomorphic to with for all . In this paper, we present some strongly light subgraphs in the family of $1$-planar graphs with minimum degree~$7$.
Paper Prompts
Sign up for free to create and run prompts on this paper.