Graphs with all holes the same length

Linda Cook,Jake Horsfield,Myriam Preissmann,Cléophée Robin,Paul Seymour,Ni Luh Dewi Sintiari,Nicolas Trotignon,Kristina Vušković

Journal of Combinatorial Theory, Series B（2024）

引用 0|浏览4

暂无评分

摘要

A graph is ℓ-holed if all its induced cycles of length at least four have length exactly ℓ. We give a complete description of the ℓ-holed graphs for each ℓ≥7.

查看译文

关键词

Hole,Cycle,Structure theorem

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要