The majestic edge coloring and the majestic 2-tone edge coloring of some cycle related graphs

Ozge Colakoglu Havare
2020 Malaya Journal of Matematik  
An edge coloring of a graph G is called a majestic edge coloring if there is the induced proper vertex coloring. If the colors of edges of the G graph have 2-elements sets and the G graph has induced proper vertex coloring then an edge coloring of the G graph is called the majestic 2-tone coloring. The majestic and the majestic 2-tone chromatic indices for some cycle related graphs which are wheel graph, gear graph, helm graph, web graph, and friendship graph are computed.
doi:10.26637/mjm0804/0011 fatcat:afsuollfzzaztgixlxyy6i54l4