Heavy paths, light stars, and big melons Original Research Article

A graph H is defined to be light in a family H of graphs if there exists a finite number w(H,H) such that each G∈H which contains H as a subgraph, contains also a subgraph K≅H such that the sum of degrees (in G) of the vertices of K (that is, the weight of K in G) is at most w(H,H). In this paper we study the conditions related to the weight of fixed subgraphs of the plane graphs which can enforce the existence of light graphs in some families of plane graphs. For the families of plane graphs and triangulations whose edges are of weight ⩾w we study the necessary and sufficient conditions for the lightness of certain graphs according to values of w.