A note on cycle lengths in graphs of chromatic number five and six
Combinatorics
2021-04-07 v1
Abstract
In this note, we prove that every non-complete -critical graph contains cycles of all lengths modulo , where .
Cite
@article{arxiv.2104.01382,
title = {A note on cycle lengths in graphs of chromatic number five and six},
author = {Qingyi Huo},
journal= {arXiv preprint arXiv:2104.01382},
year = {2021}
}
Comments
arXiv admin note: text overlap with arXiv:2012.10624