Graphs with all holes the same length

IF 1.2 1区数学 Q1 MATHEMATICS

Journal of Combinatorial Theory Series B Pub Date : 2024-05-14 DOI:10.1016/j.jctb.2024.04.006

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

引用次数: 0

Abstract

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 $ℓ \geq 7$ .

查看原文本刊更多论文

所有孔长度相同的图形

如果一个图的所有长度至少为四的诱导循环的长度正好为 ℓ，那么这个图就是 ℓ-holed 图。我们给出了每个 ℓ≥7 的 ℓ-holed 图的完整描述。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Combinatorial Theory Series B 数学-数学

CiteScore

2.70

自引率

14.30%

发文量

审稿时长

6-12 weeks

期刊介绍： The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.