加载中…
We extend the notion of -sparse graphs previously introduced by {\scshape Ho`ang} by considering -sparse graphs were denotes a finite set of graphs on vertices. Thus we obtain some results on -sparse graphs already known on -free graphs. Finally we completely describe the structure of )-sparse graphs, it follows that those graphs have bounded clique-width.

生成讲解博客的中文版本

生成AI智能校验的中文版本