On $(P_5,\bar{P_5})$-sparse graphs and other families

Simple item page
dc.creatorFouquet, Jean-Luc
dc.creatorVanherpe, Jean-Marie
dc.date2008-03-14
dc.date.accessioned2026-07-07T12:17:41Z
dc.date.available2026-07-07T12:17:41Z
dc.descriptionWe extend the notion of $P_4$-sparse graphs previously introduced by {\scshape Hoàng} 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.
dc.identifierhttps://arxiv.org/abs/0803.2135
dc.identifierhttp://arxiv.org/abs/0803.2135
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212158
dc.subjectDiscrete Mathematics
dc.titleOn $(P_5,\bar{P_5})$-sparse graphs and other families
dc.typetext

Files

Collections

arXiv