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

Here’s a scary scenario: You’ve been put in charge of air traffic control at Newark airport near New York. You need to make sure every plane can taxi between the runway and its gate without hitting ...

Taiwanese Journal of Mathematics, Vol. 24, No. 4 (August 2020), pp. 785-815 (31 pages) In 2011, Caro et al. introduced the monochromatic connection of graphs. An edge-coloring of a connected graph G ...