On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree

Xin Zhang, Guizhen Liu


A graph G is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. The family of 1-planar graphs with minimum vertex degree at least δ and minimum edge degree at least ɛ is denoted by Pδ1(ɛ). In this paper, it is proved that every graph in P71(14) (resp. P61(13)) contains a copy of chordal 4-cycle with all vertices of degree at most 10 (resp. 12).


1-planar graph, lightness, cycle, discharging

Full Text:


DOI: https://doi.org/10.26493/1855-3974.297.fa1

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