Edge colouring is a fundamental concept in graph theory whereby colours are assigned to the edges of a graph such that no two adjacent edges share the same colour. This process is central to numerous ...

Edge-Colored Graph Theory is a vibrant area within combinatorics that extends the classical study of graphs by assigning colours to edges. This paradigm not only uncovers subtle structural properties ...