Total colouring of circulant graphs Cn(1, 3)
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 Cn(1, 3), 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 Cn(1, 3) are 6 for n=7,8,12,13,17, and 5 for all others.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.