On (P5,P5)-sparse graphs and other families

Abstract

We extend the notion of P4-sparse graphs previously introduced by Ho\`ang by considering F-sparse graphs were F denotes a finite set of graphs on p vertices. Thus we obtain some results on (P5,P5)-sparse graphs already known on (P5,P5)-free graphs. Finally we completely describe the structure of (P5,P5, bull)-sparse graphs, it follows that those graphs have bounded clique-width.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…