Graphs without five-vertex path and four-vertex cycle.

Applied Mathematics and Computation（2019）

引用 0|浏览3

暂无评分

摘要

In this paper, we give a structure theorem for graphs containing no five-vertex path or four-vertex cycle as an induced subgraphs.

查看译文

关键词

Hereditary classes,Forbidden induced subgraphs,Structure theorem,Strong perfect graph theorem

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要