A Note on Colourings of Connected 2-edge Coloured Cubic Graphs
Abstract
In this short note we show that every connected 2-edge coloured cubic graph admits an 10-colouring. This lowers the best known upper bound for the chromatic number of connected 2-edge coloured cubic graphs.
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.