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

Complementary to these studies, recent investigations into injective edge-colouring have yielded significant improvements in the bounds relative to the maximum degree of a graph.

Bhaswar B. Bhattacharya, COLLISION TIMES IN MULTICOLOR URN MODELS AND SEQUENTIAL GRAPH COLORING WITH APPLICATIONS TO DISCRETE LOGARITHMS, The Annals of Applied Probability, Vol. 26, No. 6 (December ...