Strongly light subgraphs in the 1-planar graphs with minimum degree 7
Abstract
A graph is 1-planar if it can be drawn in the plane such that every edge crosses 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 G in G contains a subgraph K isomorphic to H with G(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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.