research
∙
10/10/2022
Locally irregular edge-coloring of subcubic graphs
A graph is locally irregular if no two adjacent vertices have the same d...
share
research
∙
08/28/2022
Revisiting Semistrong Edge-Coloring of Graphs
A matching M in a graph G is semistrong if every edge of M has an endver...
research
∙
02/05/2022
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
A conflict-free coloring of a graph with respect to open (resp., closed)...
research
∙
04/03/2018