Computer Science – Discrete Mathematics
Scientific paper
2008-03-14
Computer Science
Discrete Mathematics
Scientific paper
We extend the notion of $P_4$-sparse graphs previously introduced by {\scshape Ho\`ang} by considering $\mathcal{F}$-sparse graphs were $\mathcal{F}$ denotes a finite set of graphs on $p$ vertices. Thus we obtain some results on $(P_5,\bar{P_5})$-sparse graphs already known on $(P_5,\bar{P_5})$-free graphs. Finally we completely describe the structure of $(P_5,\bar{P_5}, bull$)-sparse graphs, it follows that those graphs have bounded clique-width.
Fouquet Jean-Luc
Vanherpe Jean-Marie
No associations
LandOfFree
On $(P_5,\bar{P_5})$-sparse graphs and other families does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On $(P_5,\bar{P_5})$-sparse graphs and other families, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On $(P_5,\bar{P_5})$-sparse graphs and other families will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-246617