Papers
Topics
Authors
Recent
Search
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 HH is {\em strongly light} in a family of graphs G\mathfrak{G}, if there exists a constant λ\lambda, such that every graph GG in G\mathfrak{G} contains a subgraph KK isomorphic to HH with degG(v)λ\deg_{G}(v) \leq \lambda for all vV(K)v \in V(K). In this paper, we present some strongly light subgraphs in the family of $1$-planar graphs with minimum degree~$7$.

Authors (1)
Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.