Graphs with all holes the same length
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2021
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917664566280192 |
|---|---|
| author | Cook, Linda Horsfield, Jake Preissmann, Myriam Robin, Cléophée Seymour, Paul Sintiari, Ni Luh Dewi Trotignon, Nicolas Vušković, Kristina |
| author_facet | Cook, Linda Horsfield, Jake Preissmann, Myriam Robin, Cléophée Seymour, Paul Sintiari, Ni Luh Dewi Trotignon, Nicolas Vušković, Kristina |
| contents | A graph is "$\ell$-holed" if all its induced cycles of length at least four have length exactly $\ell$. We give a complete description of the $\ell$-holed graphs for each $\ell\ge 7$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2110_09970 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Graphs with all holes the same length Cook, Linda Horsfield, Jake Preissmann, Myriam Robin, Cléophée Seymour, Paul Sintiari, Ni Luh Dewi Trotignon, Nicolas Vušković, Kristina Combinatorics 05C75 A graph is "$\ell$-holed" if all its induced cycles of length at least four have length exactly $\ell$. We give a complete description of the $\ell$-holed graphs for each $\ell\ge 7$. |
| title | Graphs with all holes the same length |
| topic | Combinatorics 05C75 |
| url | https://arxiv.org/abs/2110.09970 |