Monochromatic $k$-connection of graphs

Qingqiong Cai, Shinya Fujita, Henry Liu +1

An edge-coloured path is monochromatic if all of its edges have the same colour. For a $k$-connected graph $G$, the monochromatic $k$-connection number of $G$, denoted by $m{c}_k(G)$…