Graphs with all holes the same length
Combinatorics
2024-05-15 v3
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 .
Keywords
Cite
@article{arxiv.2110.09970,
title = {Graphs with all holes the same length},
author = {Linda Cook and Jake Horsfield and Myriam Preissmann and Cléophée Robin and Paul Seymour and Ni Luh Dewi Sintiari and Nicolas Trotignon and Kristina Vušković},
journal= {arXiv preprint arXiv:2110.09970},
year = {2024}
}