Tools for parsimonious edge-colouring of graphs with maximum degree three
Abstract
The notion of a δ-minimum edge-colouring was introduced by J-L. Fouquet (in his french PhD Thesis FouPhD). Here we present some structural properties of δ-minimum edge-colourings, partially taken from the above thesis. The paper serves as an auxiliary tool for another paper submitted by the authors to Graphs and Combinatorics.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.