Мирко Петрушевски
no.: 02911

1) Mirko Petruševski, Riste Škrekovski, Coverability of graph by three odd subgraphs, Journal of Graph Theory Vol. 92, Issue 3, (2019), 304–321 https://onlinelibrary.wiley.com/doi/full/10.1002/jgt.22455 2) M. Petruševski, R. Škrekovski, Odd decompositions and coverings of graphs, European Journal of Combinatorics 91 (2021), Article ID 103225. https://doi.org/10.1016/j.ejc.2020.103225 3) M. Petruševski, R. Škrekovski, Some Remarks on Odd Edge Colorings of Digraphs, Mathematics 9(3) (2021), 231. https://doi.org/10.3390/math9030231 4) M. Petruševski, R. Škrekovski, Coverability of Graphs by Parity Regular Subgraphs, Mathematics 9(2) (2021), 182. https://doi.org/10.3390/math9020182 5) M. Knor, M. Petruševski, R. Škrekovski, On chromatic vertex stability of 3-chromatic graphs with maximum degree 4, Discrete Mathematics Letters 10 (2022), 75-80. 6) Y. Caro, M. Petruševski, R. Škrekovski, Remarks on odd colorings of graphs, Discrete Applied Mathematics 321 (2022), 392-401. 7) M. Petruševski, R. Škrekovski, Colorings with neighborhood parity condition, Discrete Applied Mathematics 321 (2022), 385-391. 8) C. Hernández-Cruz, M. Petruševski, R. Škrekovski, Notes on weak-odd edge colorings of digraphs, Ars Mathematica Contemporanea 22(2) (2022), Paper No.5. 9) M. Petruševski, R. Škrekovski, Odd edge-colorings of subdivisions of odd graphs, J. Graph Theory 104(3) (2023), 585-610. 10) Y. Caro, M. Petruševski, R. Škrekovski, Odd-sum colorings of graphs, Australas. J. Comb. 85(2) (2023), 195-219. 11) Y. Caro, M. Petruševski, R. Škrekovski, Remarks on proper conflict-free colorings of graphs, Discrete Math. 346(2) (2023), Article ID 113221. 12) M. Petruševski, R. Škrekovski, Proper edge-colorings with a rich neighbor requirement, Discrete Math. 347(3) (2024), Article ID 113803.