1 citations · 1 across the 4 of their papers we have counts for
5 papers · 1 filter
The rich-neighbor chromatic index is linear in the maximum degree
Masaki Kashima, Mirko Petruševski, Jelena Sedlar +1
An edge of a multigraph is rich with respect to a proper edge-coloring if all the edges adjacent to it receive mutually distinct colors, and a proper edge-coloring is a rich-neighb…
On strong odd colorings of graphs
Yair Caro, Mirko Petruševski, Riste Škrekovski +1
A strong odd coloring of a simple graph is a proper coloring of the vertices of such that for every vertex and every color , either is used an odd number of time…
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…
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…
Odd edge-colorings of subdivisions of odd graphs
Mirko Petruševski, Riste Škrekovski
An odd graph is a finite graph all of whose vertices have odd degrees. Given graph is decomposable into odd subgraphs if its edge set can be partitioned into subsets ea…