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

Tao Wang

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 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.

Keywords


Strongly light subgraph, 1-planar graph.

Full Text:

PDF ABSTRACTS (EN/SI)


DOI: https://doi.org/10.26493/1855-3974.564.d96

ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications