Mirko Petrusevski

According to our database, Mirko Petrusevski authored at least 14 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Proper edge-colorings with a rich neighbor requirement.

Mirko Petrusevski, Riste Skrekovski

Discret. Math., March, 2024

2023

Odd edge-colorings of subdivisions of odd graphs.

Mirko Petrusevski, Riste Skrekovski

J. Graph Theory, November, 2023

Remarks on proper conflict-free colorings of graphs.

Yair Caro, Mirko Petrusevski, Riste Skrekovski

Discret. Math., 2023

2022

Colorings with neighborhood parity condition.

Mirko Petrusevski, Riste Skrekovski

Discret. Appl. Math., 2022

Remarks on odd colorings of graphs.

Yair Caro, Mirko Petrusevski, Riste Skrekovski

Discret. Appl. Math., 2022

Notes on weak-odd edge colorings of digraphs.

César Hernández-Cruz, Mirko Petrusevski, Riste Skrekovski

Ars Math. Contemp., 2022

2021

Odd decompositions and coverings of graphs.

Mirko Petrusevski, Riste Skrekovski

Eur. J. Comb., 2021

2019

Coverability of graph by three odd subgraphs.

Mirko Petrusevski, Riste Skrekovski

J. Graph Theory, 2019

2018

Odd 4-edge-colorability of graphs.

Mirko Petrusevski

J. Graph Theory, 2018

On vertex-parity edge-colorings.

Borut Luzar, Mirko Petrusevski, Riste Skrekovski

J. Comb. Optim., 2018

2017

A note on acyclic number of planar graphs.

Mirko Petrusevski, Riste Skrekovski

Ars Math. Contemp., 2017

2016

Mapping planar graphs into the Coxeter graph.

Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevski, Riste Skrekovski, Qiang Sun

Discret. Math., 2016

Odd edge-colorability of subcubic graphs.

Risto Atanasov, Mirko Petrusevski, Riste Skrekovski

Ars Math. Contemp., 2016

2015

Odd edge coloring of graphs.

Borut Luzar, Mirko Petrusevski, Riste Skrekovski

Ars Math. Contemp., 2015