Edge coloring is a fundamental concept in graph theory that involves assigning colors to the edges of a graph such that no two edges sharing the same vertex have the same color. This concept is ...

One significant area of focus is the definition and properties of proper conflict-free colorings, where each vertex in a graph must have at least one color that appears exactly once in its ...