Strongly light subgraphs in the 1-planar graphs with minimum degree 7
Combinatorics
2018-11-20 v2 Discrete Mathematics
Abstract
A graph is {\em -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 -planar graphs with minimum degree~.
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