3 research outputs found
Light subgraphs in graphs with average degree at most four
A graph is said to be {\em light} in a family of graphs if
at least one member of contains a copy of and there exists
an integer such that each member of
with a copy of also has a copy of such that
for all . In this
paper, we study the light graphs in the class of graphs with small average
degree, including the plane graphs with some restrictions on girth.Comment: 12 pages, 18 figure