1 citations · 1 across the 4 of their papers we have counts for
Showing 2022 · math.COShow all
2 papers · 2 filters
math.CO2022
Remarks on proper conflict-free colorings of graphs
Yair Caro, Mirko Petruševski, Riste Škrekovski
A vertex coloring of a graph is said to be \textit{conflict-free} with respect to neighborhoods if for every non-isolated vertex there is a color appearing exactly once in its (ope…
math.CO2022
Remarks on odd colorings of graphs
Yair Caro, Mirko Petruševski, Riste Škrekovski
A proper vertex coloring of graph is said to be odd if for each non-isolated vertex there exists a color such that is odd-sized. The mi…