Extremal Problems in Royal Colorings of Graphs

Akbar Ali, Gary Chartrand, James Hallas +1

An edge coloring $c$ of a graph $G$ is a royal $k$-edge coloring of $G$ if the edges of $G$ are assigned nonempty subsets of the set $\{1,2,\dots ,k\}$ in such a way that the ve…