English

Strongly light subgraphs in the 1-planar graphs with minimum degree 7

Combinatorics 2018-11-20 v2 Discrete Mathematics

Abstract

A graph is {\em 11-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 11-planar graphs with minimum degree~77.

Keywords

Cite

@article{arxiv.1304.6896,
  title  = {Strongly light subgraphs in the 1-planar graphs with minimum degree 7},
  author = {Tao Wang},
  journal= {arXiv preprint arXiv:1304.6896},
  year   = {2018}
}

Comments

6 pages, 6 figures, http://amc-journal.eu/index.php/amc/article/view/564. in Ars Mathematica Contemporanea, 2015

R2 v1 2026-06-22T00:06:19.507Z