Total colouring of circulant graphs $C_{n}(1, 3)$
Combinatorics
2025-12-25 v1
Abstract
Total colouring of 4-regular circulant graphs is an interesting but challenging topic, and has attracted much attention. However, it still remains an open question to determine the total chromatic numbers of , a subclass of 4-regular circulant graphs, even after many efforts. In this paper, we investigate the total colouring of these graphs and determine their total chromatic numbers. Our results show that the total chromatic numbers of are 6 for , and 5 for all others.
Cite
@article{arxiv.2512.20878,
title = {Total colouring of circulant graphs $C_{n}(1, 3)$},
author = {SenYuan Su and Chunling Tong and Yuansheng Yang},
journal= {arXiv preprint arXiv:2512.20878},
year = {2025}
}
Comments
10 pages, 10 figures