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ć

Research output: Contribution to journalArticlepeer-review

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 ℓ≥7.

Original languageEnglish (US)
Pages (from-to)96-158
Number of pages63
JournalJournal of Combinatorial Theory. Series B
Volume168
DOIs
StatePublished - Sep 2024

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Keywords

  • Cycle
  • Hole
  • Structure theorem

Fingerprint

Dive into the research topics of 'Graphs with all holes the same length'. Together they form a unique fingerprint.

Cite this