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 lambda, such that every graph G in G contains a subgraph K isomorphic to H with deg_G (v) <= lambda for all v in V(K). In this paper, we present some strongly light subgraphs in the family of 1-planar graphs with minimum degree 7.
@article{564,
title = {Strongly light subgraphs in the 1-planar graphs with minimum degree 7},
journal = {ARS MATHEMATICA CONTEMPORANEA},
volume = {11},
year = {2015},
doi = {10.26493/1855-3974.564.d96},
language = {EN},
url = {http://dml.mathdoc.fr/item/564}
}
Wang, Tao. Strongly light subgraphs in the 1-planar graphs with minimum degree 7. ARS MATHEMATICA CONTEMPORANEA, Tome 11 (2015) . doi : 10.26493/1855-3974.564.d96. http://gdmltest.u-ga.fr/item/564/