The 7-cycle image is light in the family of planar graphs with minimum degree 5 Original Research Article

A connected graph H is said to be light in the family of graphs image if there exists a positive integer k such that each graph image that contains an isomorphic copy of H contains a subgraph K isomorphic to H that satisfies the inequality image. It is known that an r-cycle image is light in the family of planar graphs with minimum degree 5 if image, and not light for image. We prove that image is also light in this family.