Caro, Yair; Petruševski, Mirko; Škrekovski, Riste Remarks on proper conflict-free colorings of graphs. (English) Zbl 1504.05085 Discrete Math. 346, No. 2, Article ID 113221, 14 p. (2023). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{Y. Caro} et al., Discrete Math. 346, No. 2, Article ID 113221, 14 p. (2023; Zbl 1504.05085) Full Text: DOI arXiv
Knor, Martin; Petruševski, Mirko; Škrekovski, Riste On chromatic vertex stability of 3-chromatic graphs with maximum degree 4. (English) Zbl 1513.05158 DML, Discrete Math. Lett. 10, 75-80 (2022). MSC: 05C15 PDFBibTeX XMLCite \textit{M. Knor} et al., DML, Discrete Math. Lett. 10, 75--80 (2022; Zbl 1513.05158) Full Text: DOI arXiv
Caro, Yair; Petruševski, Mirko; Škrekovski, Riste Remarks on odd colorings of graphs. (English) Zbl 1497.05070 Discrete Appl. Math. 321, 392-401 (2022). MSC: 05C15 PDFBibTeX XMLCite \textit{Y. Caro} et al., Discrete Appl. Math. 321, 392--401 (2022; Zbl 1497.05070) Full Text: DOI arXiv
Cranston, Daniel W.; Erman, Rok; Škrekovski, Riste Choosability of the square of a planar graph with maximum degree four. (English) Zbl 1296.05053 Australas. J. Comb. 59, Part 1, 86-97 (2014). MSC: 05C10 05C15 05C07 05C35 PDFBibTeX XMLCite \textit{D. W. Cranston} et al., Australas. J. Comb. 59, Part 1, 86--97 (2014; Zbl 1296.05053) Full Text: arXiv Link
Kaiser, Tomáš; Rucký, Ondřej; Stehlík, Matěj; Škrekovski, Riste Strong parity vertex coloring of plane graphs. (English) Zbl 1288.05090 Discrete Math. Theor. Comput. Sci. 16, No. 1, 143-158 (2014). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{T. Kaiser} et al., Discrete Math. Theor. Comput. Sci. 16, No. 1, 143--158 (2014; Zbl 1288.05090) Full Text: Link
Dvořák, Zdeněk; Škrekovski, Riste \(k\)-chromatic number of graphs on surfaces. (English) Zbl 1200.05079 SIAM J. Discrete Math. 23, No. 1, 477-486 (2009). Reviewer: Markus Fulmek (Wien) MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{Z. Dvořák} and \textit{R. Škrekovski}, SIAM J. Discrete Math. 23, No. 1, 477--486 (2009; Zbl 1200.05079) Full Text: DOI
Lužar, Borut; Škrekovski, Riste; Tancer, Martin Injective colorings of planar graphs with few colors. (English) Zbl 1209.05093 Discrete Math. 309, No. 18, 5636-5649 (2009). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{B. Lužar} et al., Discrete Math. 309, No. 18, 5636--5649 (2009; Zbl 1209.05093) Full Text: DOI
Dvořák, Zdeněk; Škrekovski, Riste; Tancer, Martin List-coloring squares of sparse subcubic graphs. (English) Zbl 1159.05018 SIAM J. Discrete Math. 22, No. 1, 139-159 (2008). Reviewer: Peter Horák (Tacoma) MSC: 05C15 PDFBibTeX XMLCite \textit{Z. Dvořák} et al., SIAM J. Discrete Math. 22, No. 1, 139--159 (2008; Zbl 1159.05018) Full Text: DOI Link
Kaiser, Tomáš; Král’, Daniel; Škrekovski, Riste; Zhu, Xuding The circular chromatic index of graphs of high girth. (English) Zbl 1114.05036 J. Comb. Theory, Ser. B 97, No. 1, 1-13 (2007). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C15 PDFBibTeX XMLCite \textit{T. Kaiser} et al., J. Comb. Theory, Ser. B 97, No. 1, 1--13 (2007; Zbl 1114.05036) Full Text: DOI
Stiebitz, Michael; Škrekovski, Riste A map colour theorem for the union of graphs. (English) Zbl 1098.05034 J. Comb. Theory, Ser. B 96, No. 1, 20-37 (2006). Reviewer: Saul Stahl (Lawrence) MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{M. Stiebitz} and \textit{R. Škrekovski}, J. Comb. Theory, Ser. B 96, No. 1, 20--37 (2006; Zbl 1098.05034) Full Text: DOI
Füredi, Zoltan; Kostochka, Alexandr V.; Škrekovski, Riste; Stiebitz, Michael; West, Douglas B. Nordhaus-Gaddum-type theorems for decompositions into many parts. (English) Zbl 1078.05068 J. Graph Theory 50, No. 4, 273-292 (2005). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C70 05C35 05C15 PDFBibTeX XMLCite \textit{Z. Füredi} et al., J. Graph Theory 50, No. 4, 273--292 (2005; Zbl 1078.05068) Full Text: DOI
Juvan, M.; Mohar, B.; Škrekovski, R. List total colourings of graphs. (English) Zbl 0911.05033 Comb. Probab. Comput. 7, No. 2, 181-188 (1998). Reviewer: H.P.Yap (Singapore) MSC: 05C15 PDFBibTeX XMLCite \textit{M. Juvan} et al., Comb. Probab. Comput. 7, No. 2, 181--188 (1998; Zbl 0911.05033) Full Text: DOI