Extremal Problems in Royal Colorings of Graphs

27 Sep 2019 Ali Akbar Chartrand Gary Hallas James Zhang Ping

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, \ldots, k\}$ in such a way that the vertex coloring obtained by assigning the union of the colors of the incident edges of each vertex is a proper vertex coloring. If the vertex coloring is vertex-distinguishing, then $c$ is a strong royal $k$-edge coloring... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS