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 ...

The study of graph colouring has long been a central topic in discrete mathematics, with a prominent focus on optimising the assignment of labels or colours to vertices such that adjacent vertices are ...