Riste Skrekovski

213 papers C 3Journal 208Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A remark on a result on odd colorings of planar graphs. Discret. Math. Dinabandhu Pradhan, Vaishali Sharma, Riste Skrekovski
2026	J	`jnl`	Invitation to the subpath number. Appl. Math. Comput. Martin Knor, Jelena Sedlar, Riste Skrekovski, Yu Yang
2026	J	`jnl`	Proper conflict-free degree-choosability of outerplanar graphs. Discret. Math. Masaki Kashima, Riste Skrekovski, Rongxing Xu
2026	J	`jnl`	Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy. Discret. Math. Masaki Kashima, Riste Skrekovski, Rongxing Xu
2026	J	`jnl`	The subpath number of cactus graphs. Comput. Appl. Math. Martin Knor, Jelena Sedlar, Riste Skrekovski, Yu Yang
2026	J	`jnl`	The σ -irregularity of trees with maximum degree 5. Discret. Appl. Math. Darko Dimitrov, Zana Kovijanic Vukicevic, Goran Popivoda, Jelena Sedlar, Riste Skrekovski, Sasa Vujosevic
2025	J	`jnl`	Domination number of modular product graphs. Comput. Appl. Math. Sergio Bermudo, Iztok Peterin, Jelena Sedlar, Riste Skrekovski
2025	J	`jnl`	Extremizing antiregular graphs by modifying total σ-irregularity. Appl. Math. Comput. Martin Knor, Riste Skrekovski, Slobodan Filipovski, Darko Dimitrov
2025	J	`jnl`	On regular graphs with Šoltés vertices. Ars Math. Contemp. Nino Basic, Martin Knor, Riste Skrekovski
2025	J	`jnl`	On strong odd colorings of graphs. Discret. Math. Yair Caro, Mirko Petrusevski, Riste Skrekovski, Zsolt Tuza
2025	J	`jnl`	Type-based computation of knowledge graph statistics. Ann. Math. Artif. Intell. Iztok Savnik, Kiyoshi Nitta, Riste Skrekovski, Nikolaus Augsten
2024	J	`jnl`	Criticality in Sperner's Lemma. Comb. Tomás Kaiser, Matej Stehlík, Riste Skrekovski
2024	J	`jnl`	Diameter of nanotori. Appl. Math. Comput. Vesna Andova, Pavel Dimovski, Martin Knor, Riste Skrekovski
2024	J	`jnl`	Local Irregularity Conjecture vs. cacti. Discret. Appl. Math. Jelena Sedlar, Riste Skrekovski
2024	J	`jnl`	Normal 5-edge-coloring of some snarks superpositioned by Flower snarks. Eur. J. Comb. Jelena Sedlar, Riste Skrekovski
2024	J	`jnl`	Normal 5-edge-coloring of some snarks superpositioned by the Petersen graph. Appl. Math. Comput. Jelena Sedlar, Riste Skrekovski
2024	J	`jnl`	Proper edge-colorings with a rich neighbor requirement. Discret. Math. Mirko Petrusevski, Riste Skrekovski
2024	J	`jnl`	Resolving vertices of graphs with differences. Comput. Appl. Math. Iztok Peterin, Jelena Sedlar, Riste Skrekovski, Ismael G. Yero
2024	J	`jnl`	Selected topics on Wiener index. Ars Math. Contemp. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2023	J	`jnl`	Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$. J. Graph Theory Reza Naserasr, Riste Skrekovski, Zhouningxin Wang, Rongxing Xu
2023	J	`jnl`	Multiset-Trie Data Structure. Algorithms Mikita Akulich, Iztok Savnik, Matjaz Krnc, Riste Skrekovski
2023	J	`jnl`	Odd edge-colorings of subdivisions of odd graphs. J. Graph Theory Mirko Petrusevski, Riste Skrekovski
2023	J	`jnl`	On maximum Wiener index of directed grids. Art Discret. Appl. Math. Martin Knor, Riste Skrekovski
2023	J	`jnl`	Remarks on proper conflict-free colorings of graphs. Discret. Math. Yair Caro, Mirko Petrusevski, Riste Skrekovski
2022	J	`jnl`	A note on the metric and edge metric dimensions of 2-connected graphs. Discret. Appl. Math. Martin Knor, Riste Skrekovski, Ismael G. Yero
2022	J	`jnl`	Colorings with neighborhood parity condition. Discret. Appl. Math. Mirko Petrusevski, Riste Skrekovski
2022	J	`jnl`	Evaluating group degree centrality and centralization in networks. Informatica (Slovenia) Mario Karlovcec, Matjaz Krnc, Riste Skrekovski
2022	J	`jnl`	Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two. Appl. Math. Comput. Jelena Sedlar, Riste Skrekovski
2022	J	`jnl`	Notes on weak-odd edge colorings of digraphs. Ars Math. Contemp. César Hernández-Cruz, Mirko Petrusevski, Riste Skrekovski
2022	J	`jnl`	On 12-regular nut graphs. Art Discret. Appl. Math. Nino Basic, Martin Knor, Riste Skrekovski
2022	J	`jnl`	On metric dimensions of hypercubes. Ars Math. Contemp. Aleksander Kelenc, Aoden Teo Masa Toshi, Riste Skrekovski, Ismael G. Yero
2022	J	`jnl`	Remarks on odd colorings of graphs. Discret. Appl. Math. Yair Caro, Mirko Petrusevski, Riste Skrekovski
2022	—	`conf`	Statistics of RDF Store for Querying Knowledge Graphs. FoIKS Iztok Savnik, Kiyoshi Nitta, Riste Skrekovski, Nikolaus Augsten
2022	J	`jnl`	Vertex and edge metric dimensions of cacti. Discret. Appl. Math. Jelena Sedlar, Riste Skrekovski
2022	J	`jnl`	Vertex and edge metric dimensions of unicyclic graphs. Discret. Appl. Math. Jelena Sedlar, Riste Skrekovski
2021	J	`jnl`	Arithmetic-geometric index and its relations with geometric-arithmetic index. Appl. Math. Comput. Sasa Vujosevic, Goran Popivoda, Zana Kovijanic Vukicevic, Boris Furtula, Riste Skrekovski
2021	J	`jnl`	Bounding the Discret. Math. Kerry Ojakian, Riste Skrekovski, Aleksandra Tepeh
2021	J	`jnl`	Bounds on metric dimensions of graphs with edge disjoint cycles. Appl. Math. Comput. Jelena Sedlar, Riste Skrekovski
2021	J	`jnl`	Domination versus independent domination in regular graphs. J. Graph Theory Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2021	J	`jnl`	Extremal mixed metric dimension with respect to the cyclomatic number. Appl. Math. Comput. Jelena Sedlar, Riste Skrekovski
2021	J	`jnl`	Graphs with the edge metric dimension smaller than the metric dimension. Appl. Math. Comput. Martin Knor, Snjezana Majstorovic, Aoden Teo Masa Toshi, Riste Skrekovski, Ismael G. Yero
2021	J	`jnl`	Mixed metric dimension of graphs with edge disjoint cycles. Discret. Appl. Math. Jelena Sedlar, Riste Skrekovski
2021	J	`jnl`	Odd decompositions and coverings of graphs. Eur. J. Comb. Mirko Petrusevski, Riste Skrekovski
2021	J	`jnl`	Statistics of Knowledge Graphs Based On The Conceptual Schema. CoRR Iztok Savnik, Kiyoshi Nitta, Riste Skrekovski, Nikolaus Augsten
2020	J	`jnl`	Eccentricity of networks with structural constraints. Discuss. Math. Graph Theory Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma
2020	J	`jnl`	Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs. Discret. Appl. Math. Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski
2020	J	`jnl`	Maximal Wiener index for graphs with prescribed number of blocks. Appl. Math. Comput. Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski
2020	—	`conf`	Redundant binary representations with rigorous trade-off between connectivity and locality. GECCO Companion Vida Vukasinovic, David Kubon, Riste Skrekovski, Petr Gregor
2020	J	`jnl`	Remarks on Distance Based Topological Indices for ℓ-Apex Trees. Symmetry Martin Knor, Muhammad Imran, Muhammad Kamran Jamil, Riste Skrekovski
2020	J	`jnl`	Some remarks on Balaban and sum-Balaban index. Art Discret. Appl. Math. Martin Knor, Jozef Komorník, Riste Skrekovski, Aleksandra Tepeh
2020	J	`jnl`	The structure of graphs with given number of blocks and the maximum Wiener index. J. Comb. Optim. Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski
2020	J	`jnl`	Trees with Minimum Weighted Szeged Index Are of a Large Diameter. Symmetry Risto Atanasov, Boris Furtula, Riste Skrekovski
2020	J	`jnl`	Variations on the Petersen Colouring Conjecture. Electron. J. Comb. François Pirot, Jean-Sébastien Sereni, Riste Skrekovski
2019	J	`jnl`	An inequality between variable wiener index and variable szeged index. Appl. Math. Comput. Katarína Hrináková, Martin Knor, Riste Skrekovski
2019	J	`jnl`	Coverability of graph by three odd subgraphs. J. Graph Theory Mirko Petrusevski, Riste Skrekovski
2019	J	`jnl`	Facial unique-maximum colorings of plane graphs with restriction on big vertices. Discret. Math. Bernard Lidický, Kacy Messerschmidt, Riste Skrekovski
2019	J	`jnl`	Graphs with a given diameter that maximise the Wiener index. Appl. Math. Comput. Qiang Sun, Barbara Ikica, Riste Skrekovski, Vida Vukasinovic
2019	J	`jnl`	Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs. CoRR Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski
2019	J	`jnl`	Maximum external Wiener index of graphs. Discret. Appl. Math. Darko Dimitrov, Barbara Ikica, Riste Skrekovski
2019	J	`jnl`	On Extremal Graphs of Weighted Szeged Index. CoRR Jan Bok, Boris Furtula, Nikola Jedlicková, Riste Skrekovski
2019	J	`jnl`	On the minimum distance in a Appl. Math. Comput. Martin Knor, Riste Skrekovski
2019	J	`jnl`	Remarks on Multiplicative Atom-Bond Connectivity Index. IEEE Access Riste Skrekovski, Darko Dimitrov, Jiemei Zhong, Hualong Wu, Wei Gao
2019	J	`jnl`	The structure of graphs with given number of blocks and the maximum Wiener index. CoRR Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski
2019	J	`jnl`	Total positivity of Toeplitz matrices of recursive hypersequences. Ars Math. Contemp. Tomislav Doslic, Ivica Martinjak, Riste Skrekovski
2019	J	`jnl`	Trees with the maximal value of Graovac-Pisanski index. Appl. Math. Comput. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2019	J	`jnl`	Unicyclic graphs with the maximal value of Graovac-Pisanski index. Ars Math. Contemp. Martin Knor, Jozef Komorník, Riste Skrekovski, Aleksandra Tepeh
2018	J	`jnl`	A counterexample to a conjecture on facial unique-maximal colorings. Discret. Appl. Math. Bernard Lidický, Kacy Messerschmidt, Riste Skrekovski
2018	J	`jnl`	Broadcasting multiple messages in the 1-in port model in optimal time. J. Comb. Optim. Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2018	J	`jnl`	Extending Perfect Matchings to Gray Codes with Prescribed Ends. Electron. J. Comb. Petr Gregor, Tomás Novotný, Riste Skrekovski
2018	J	`jnl`	Graphs preserving Wiener index upon vertex removal. Appl. Math. Comput. Martin Knor, Snjezana Majstorovic, Riste Skrekovski
2018	J	`jnl`	Graphs preserving total distance upon vertex removal. Electron. Notes Discret. Math. Snjezana Majstorovic, Martin Knor, Riste Skrekovski
2018	J	`jnl`	Graphs whose Wiener index does not change when a specific vertex is removed. Discret. Appl. Math. Martin Knor, Snjezana Majstorovic, Riste Skrekovski
2018	J	`jnl`	Modelling simultaneous broadcasting by level-disjoint partitions. Appl. Math. Comput. Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2018	J	`jnl`	On a conjecture about the ratio of Wiener index in iterated line graphs. Art Discret. Appl. Math. Martin Knor, Katarína Hrináková, Riste Skrekovski
2018	J	`jnl`	On facial unique-maximum (edge-)coloring. Discret. Appl. Math. Vesna Andova, Bernard Lidický, Borut Luzar, Riste Skrekovski
2018	J	`jnl`	On vertex-parity edge-colorings. J. Comb. Optim. Borut Luzar, Mirko Petrusevski, Riste Skrekovski
2017	J	`jnl`	A note on acyclic number of planar graphs. Ars Math. Contemp. Mirko Petrusevski, Riste Skrekovski
2017	J	`jnl`	Leapfrog fullerenes and Wiener index. Appl. Math. Comput. Vesna Andova, Damir Orlic, Riste Skrekovski
2017	J	`jnl`	On the difference between the Szeged and the Wiener index. Appl. Math. Comput. Marthe Bonamy, Martin Knor, Borut Luzar, Alexandre Pinlou, Riste Skrekovski
2017	J	`jnl`	On the minimum value of sum-Balaban index. Appl. Math. Comput. Martin Knor, Jaka Kranjc, Riste Skrekovski, Aleksandra Tepeh
2017	J	`jnl`	Relative edge betweenness centrality. Ars Math. Contemp. Damir Vukicevic, Riste Skrekovski, Aleksandra Tepeh
2017	J	`jnl`	Remarks on maximum atom-bond connectivity index with given graph parameters. Discret. Appl. Math. Darko Dimitrov, Barbara Ikica, Riste Skrekovski
2017	J	`jnl`	Remarks on the Graovac-Ghorbani index of bipartite graphs. Appl. Math. Comput. Darko Dimitrov, Barbara Ikica, Riste Skrekovski
2016	J	`jnl`	A measure for a balanced workload and its extremal values. Discret. Appl. Math. Jelena Govorcin, Riste Skrekovski, Vida Vukasinovic, Damir Vukicevic
2016	J	`jnl`	A search for the minimum value of Balaban index. Appl. Math. Comput. Martin Knor, Jaka Kranjc, Riste Skrekovski, Aleksandra Tepeh
2016	J	`jnl`	Closeness centralization measure for two-mode data of prescribed sizes. Netw. Sci. Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma
2016	J	`jnl`	Digraphs with large maximum Wiener index. Appl. Math. Comput. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2016	J	`jnl`	Mapping planar graphs into the Coxeter graph. Discret. Math. Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevski, Riste Skrekovski, Qiang Sun
2016	J	`jnl`	Mathematical aspects of Wiener index. Ars Math. Contemp. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2016	J	`jnl`	Mathematical aspects of fullerenes. Ars Math. Contemp. Vesna Andova, Frantisek Kardos, Riste Skrekovski
2016	J	`jnl`	Modelling simultaneous broadcasting by level-disjoint partitions. CoRR Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2016	J	`jnl`	Odd edge-colorability of subcubic graphs. Ars Math. Contemp. Risto Atanasov, Mirko Petrusevski, Riste Skrekovski
2016	J	`jnl`	Orientations of graphs with maximum Wiener index. Discret. Appl. Math. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2016	J	`jnl`	Remarks on the maximum atom-bond connectivity index of graphs with given parameters. CoRR Darko Dimitrov, Barbara Ikica, Riste Skrekovski
2016	J	`jnl`	Some remarks on Wiener index of oriented graphs. Appl. Math. Comput. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2016	J	`jnl`	Star Edge Coloring of Some Classes of Graphs. J. Graph Theory L'udmila Bezegová, Borut Luzar, Martina Mockovciaková, Roman Soták, Riste Skrekovski
2016	C	`conf`	Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model. COCOA Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2015	J	`jnl`	An inequality between the edge-Wiener index and the Wiener index of a graph. Appl. Math. Comput. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2015	J	`jnl`	Centralization of transmission in networks. Discret. Math. Matjaz Krnc, Riste Skrekovski
2015	J	`jnl`	Comparing the irregularity and the total irregularity of graphs. Ars Math. Contemp. Darko Dimitrov, Riste Skrekovski
2015	J	`jnl`	Counterexamples to a conjecture on injective colorings. Ars Math. Contemp. Borut Luzar, Riste Skrekovski
2015	J	`jnl`	Group centralization of network indices. Discret. Appl. Math. Matjaz Krnc, Riste Skrekovski
2015	J	`jnl`	Odd edge coloring of graphs. Ars Math. Contemp. Borut Luzar, Mirko Petrusevski, Riste Skrekovski
2015	J	`jnl`	Rooted level-disjoint partitions of Cartesian products. Appl. Math. Comput. Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2015	J	`jnl`	Sandwiching the (generalized) Randić index. Discret. Appl. Math. Martin Knor, Borut Luzar, Riste Skrekovski
2015	J	`jnl`	l-facial edge colorings of graphs. Discret. Appl. Math. Borut Luzar, Martina Mockovciaková, Roman Soták, Riste Skrekovski, Peter Sugerek
2014	J	`jnl`	Choosability of the square of a planar graph with maximum degree four. Australas. J Comb. Daniel W. Cranston, Rok Erman, Riste Skrekovski
2014	J	`jnl`	Complete solution of equation W(L Discret. Appl. Math. Martin Knor, Martin Macaj, Primoz Potocnik, Riste Skrekovski
2014	J	`jnl`	Modeling acquaintance networks based on balance theory. Int. J. Appl. Math. Comput. Sci. Vida Vukasinovic, Jurij Silc, Riste Skrekovski
2014	J	`jnl`	On the connectivity of Cartesian product of graphs. Ars Math. Contemp. Jelena Govorcin, Riste Skrekovski
2014	J	`jnl`	Relationship between the edge-Wiener index and the Gutman index of a graph. Discret. Appl. Math. Martin Knor, Primoz Potocnik, Riste Skrekovski
2014	J	`jnl`	Replication in critical graphs and the persistence of monomial ideals. J. Comb. Theory A Tomás Kaiser, Matej Stehlík, Riste Skrekovski
2014	J	`jnl`	Strong edge-coloring of planar graphs. Discret. Math. Dávid Hudák, Borut Luzar, Roman Soták, Riste Skrekovski
2014	J	`jnl`	Strong parity vertex coloring of plane graphs. Discret. Math. Theor. Comput. Sci. Tomás Kaiser, Ondrej Rucký, Matej Stehlík, Riste Skrekovski
2014	J	`jnl`	Sufficient sparseness conditions for G Discret. Appl. Math. Daniel W. Cranston, Riste Skrekovski
2014	J	`jnl`	Wiener index of generalized 4-stars and of their quadratic line graphs. Australas. J Comb. Martin Knor, Riste Skrekovski
2013	J	`jnl`	A bound on the number of perfect matchings in Klee-graphs. Discret. Math. Theor. Comput. Sci. Marek Cygan, Marcin Pilipczuk, Riste Skrekovski
2013	J	`jnl`	Improved bound on facial parity edge coloring. Discret. Math. Borut Luzar, Riste Skrekovski
2013	J	`jnl`	Line graph operation and small worlds. Inf. Process. Lett. Jelena Govorcin, Martin Knor, Riste Skrekovski
2013	J	`jnl`	Linear time construction of a compressed Gray code. Eur. J. Comb. Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
2013	J	`jnl`	On a variation of the Randíc index. Australas. J Comb. Vesna Andova, Martin Knor, Primoz Potocnik, Riste Skrekovski
2013	J	`jnl`	On the mutually independent Hamiltonian cycles in faulty hypercubes. Inf. Sci. Vida Vukasinovic, Petr Gregor, Riste Skrekovski
2013	J	`jnl`	Wiener index of iterated line graphs of trees homeomorphic to the claw Ars Math. Contemp. Martin Knor, Primoz Potocnik, Riste Skrekovski
2013	J	`jnl`	Wiener index of iterated line graphs of trees homeomorphic to. Discret. Math. Martin Knor, Primoz Potocnik, Riste Skrekovski
2012	J	`jnl`	A note on Zagreb indices inequality for trees and unicyclic graphs. Ars Math. Contemp. Vesna Andova, Nathann Cohen, Riste Skrekovski
2012	J	`jnl`	Acyclic edge coloring of planar graphs with Δ colors. Discret. Appl. Math. Dávid Hudák, Frantisek Kardos, Borut Luzar, Roman Soták, Riste Skrekovski
2012	J	`jnl`	Bipartizing fullerenes. Eur. J. Comb. Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
2012	J	`jnl`	Brooksʼ Theorem for generalized dart graphs. Inf. Process. Lett. Martin Kochol, Riste Skrekovski
2012	J	`jnl`	Hyperbolic analogues of fullerenes on orientable surfaces. Discret. Math. Mathieu Dutour Sikiric, Martin Knor, Primoz Potocnik, Jozef Sirán, Riste Skrekovski
2012	J	`jnl`	On a conjecture about Wiener index in iterated line graphs of trees. Discret. Math. Martin Knor, Primoz Potocnik, Riste Skrekovski
2012	J	`jnl`	Parity vertex colorings of binomial trees. Discuss. Math. Graph Theory Petr Gregor, Riste Skrekovski
2012	J	`jnl`	Queue Layouts of Hypercubes. SIAM J. Discret. Math. Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2012	J	`jnl`	Some remarks on inverse Wiener index problem. Discret. Appl. Math. Jirí Fink, Borut Luzar, Riste Skrekovski
2012	J	`jnl`	Some results on Vizing's conjecture and related problems. Discret. Appl. Math. Marcin Pilipczuk, Michal Pilipczuk, Riste Skrekovski
2012	J	`jnl`	The Wiener index in iterated line graphs. Discret. Appl. Math. Martin Knor, Primoz Potocnik, Riste Skrekovski
2011	J	`jnl`	Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable. SIAM J. Discret. Math. Tomás Kaiser, Ondrej Rucký, Riste Skrekovski
2011	J	`jnl`	Graphs with Two Crossings Are 5-Choosable. SIAM J. Discret. Math. Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
2011	J	`jnl`	On the 2-Resonance of Fullerenes. SIAM J. Discret. Math. Tomás Kaiser, Matej Stehlík, Riste Skrekovski
2011	J	`jnl`	On the Zagreb index inequality of graphs with prescribed vertex degrees. Discret. Appl. Math. Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk, Riste Skrekovski
2011	J	`jnl`	On the queue-number of the hypercube. Electron. Notes Discret. Math. Petr Gregor, Riste Skrekovski, Vida Vukasinovic
2011	J	`jnl`	Randić index and the diameter of a graph. Eur. J. Comb. Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
2010	J	`jnl`	3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles. SIAM J. Discret. Math. Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
2010	J	`jnl`	An improved bound on the largest induced forests for triangle-free planar graphs. Discret. Math. Theor. Comput. Sci. Lukasz Kowalik, Borut Luzar, Riste Skrekovski
2010	J	`jnl`	An improved linear bound on the number of perfect matchings in cubic graphs. Eur. J. Comb. Louis Esperet, Daniel Král', Petr Skoda, Riste Skrekovski
2010	J	`jnl`	Backbone colorings of graphs with bounded degree. Discret. Appl. Math. Jozef Miskuf, Riste Skrekovski, Martin Tancer
2010	C	`conf`	Dichotomy for Coloring of Dart Graphs. IWOCA Martin Kochol, Riste Skrekovski
2010	J	`jnl`	Facial colorings using Hall's Theorem. Eur. J. Comb. Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski
2010	J	`jnl`	Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. J. Graph Theory Zdenek Dvorák, Daniel Král', Riste Skrekovski
2010	J	`jnl`	On generalized middle-level problem. Inf. Sci. Petr Gregor, Riste Skrekovski
2009	J	`jnl`	Backbone Colorings and Generalized Mycielski Graphs. SIAM J. Discret. Math. Jozef Miskuf, Riste Skrekovski, Martin Tancer
2009	J	`jnl`	Distance constrained labelings of planar graphs with no short cycles. Discret. Appl. Math. Zdenek Dvorák, Daniel Král, Pavel Nejedlý, Riste Skrekovski
2009	C	`conf`	Gray Code Compression. IWOCA Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
2009	J	`jnl`	Gray Codes Avoiding Matchings. Discret. Math. Theor. Comput. Sci. Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
2009	J	`jnl`	Homomorphisms of triangle-free graphs without a K Discret. Math. Reza Naserasr, Yared Nigussie, Riste Skrekovski
2009	J	`jnl`	Injective colorings of planar graphs with few colors. Discret. Math. Borut Luzar, Riste Skrekovski, Martin Tancer
2009	J	`jnl`	Long cycles in hypercubes with distant faulty vertices. Discret. Math. Theor. Comput. Sci. Petr Gregor, Riste Skrekovski
2009	J	`jnl`	Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. Discret. Math. Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
2009	J	`jnl`	k-Chromatic Number of Graphs on Surfaces. SIAM J. Discret. Math. Zdenek Dvorák, Riste Skrekovski
2008	J	`jnl`	3-Facial Coloring of Plane Graphs. SIAM J. Discret. Math. Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski
2008	J	`jnl`	Coloring squares of planar graphs with girth six. Eur. J. Comb. Zdenek Dvorák, Daniel Král, Pavel Nejedlý, Riste Skrekovski
2008	J	`jnl`	Cycles Intersecting Edge-Cuts of Prescribed Sizes. SIAM J. Discret. Math. Tomás Kaiser, Riste Skrekovski
2008	J	`jnl`	List-Coloring Squares of Sparse Subcubic Graphs. SIAM J. Discret. Math. Zdenek Dvorák, Riste Skrekovski, Martin Tancer
2008	J	`jnl`	Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph. SIAM J. Discret. Math. Zdenek Dvorák, Riste Skrekovski, Tomás Valla
2008	J	`jnl`	Total-Coloring of Plane Graphs with Maximum Degree Nine. SIAM J. Discret. Math. Lukasz Kowalik, Jean-Sébastien Sereni, Riste Skrekovski
2007	J	`jnl`	A Generalization of Kotzig's Theorem and Its Application. SIAM J. Discret. Math. Richard Cole, Lukasz Kowalik, Riste Skrekovski
2007	J	`jnl`	Cyclic, diagonal and facial colorings - a missing case. Eur. J. Comb. Daniel Král, Tomás Madaras, Riste Skrekovski
2007	J	`jnl`	Four gravity results. Discret. Math. Zdenek Dvorák, Riste Skrekovski, Tomás Valla
2007	J	`jnl`	Lightness, heaviness and gravity. Discret. Math. Tomás Madaras, Riste Skrekovski
2007	J	`jnl`	On cube-free median graphs. Discret. Math. Bostjan Bresar, Sandi Klavzar, Riste Skrekovski
2007	J	`jnl`	The 7-cycle C Discret. Math. Tomás Madaras, Riste Skrekovski, Heinz-Jürgen Voss
2007	J	`jnl`	The circular chromatic index of graphs of high girth. J. Comb. Theory B Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu
2006	J	`jnl`	3-facial colouring of plane graphs CoRR Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski
2006	J	`jnl`	A Theorem About a Contractible and Light Edge. SIAM J. Discret. Math. Zdenek Dvorák, Riste Skrekovski
2006	J	`jnl`	A map colour theorem for the union of graphs. J. Comb. Theory B Michael Stiebitz, Riste Skrekovski
2006	J	`jnl`	Colorings Of Plane Graphs With No Rainbow Faces. Comb. Veselin Jungic, Daniel Král, Riste Skrekovski
2006	J	`jnl`	Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings. SIAM J. Discret. Math. Daniel Král, Riste Skrekovski, Martin Tancer
2006	J	`jnl`	Roots of cube polynomials of median graphs. J. Graph Theory Bostjan Bresar, Sandi Klavzar, Riste Skrekovski
2006	J	`jnl`	The last excluded case of Dirac's map-color theorem for choosability. J. Graph Theory Daniel Král, Riste Skrekovski
2005	J	`jnl`	A Brooks-Type Theorem for the Generalized List T-Coloring. SIAM J. Discret. Math. Jirí Fiala, Daniel Král, Riste Skrekovski
2005	J	`jnl`	Coloring face hypergraphs on surfaces. Eur. J. Comb. Zdenek Dvorák, Daniel Král, Riste Skrekovski
2005	J	`jnl`	Cyclic, diagonal and facial colorings. Eur. J. Comb. Daniel Král, Tomás Madaras, Riste Skrekovski
2005	J	`jnl`	Generalized list T-colorings of cycles. Discret. Appl. Math. Jirí Fiala, Riste Skrekovski
2005	J	`jnl`	Nordhaus-Gaddum-type Theorems for decompositions into many parts. J. Graph Theory Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West
2005	J	`jnl`	Nowhere-zero 3-flows in abelian Cayley graphs. Discret. Math. Primoz Potocnik, Martin Skoviera, Riste Skrekovski
2004	J	`jnl`	A revival of the girth conjecture. J. Comb. Theory B Tomás Kaiser, Daniel Král, Riste Skrekovski
2004	J	`jnl`	Borodin's conjecture on diagonal coloring is false. Eur. J. Comb. Daniel Král, Riste Skrekovski
2004	J	`jnl`	Heavy paths, light stars, and big melons. Discret. Math. Tomás Madaras, Riste Skrekovski
2004	J	`jnl`	Planar graph colorings without short monochromatic cycles. J. Graph Theory Tomás Kaiser, Riste Skrekovski
2004	J	`jnl`	Subdivisions of large complete bipartite graphs and long induced paths in J. Graph Theory Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz
2003	J	`jnl`	A Theorem about the Channel Assignment Problem. SIAM J. Discret. Math. Daniel Král, Riste Skrekovski
2003	J	`jnl`	A theorem on integer flows on cartesian products of graphs. J. Graph Theory Wilfried Imrich, Riste Skrekovski
2003	J	`jnl`	Hajós' theorem for list colorings of hypergraphs. Discuss. Math. Graph Theory Claude Benzaken, Sylvain Gravier, Riste Skrekovski
2003	J	`jnl`	Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9. J. Graph Theory Bojan Mohar, Riste Skrekovski, Heinz-Jürgen Voss
2003	J	`jnl`	Quasi-median graphs, their generalizations, and tree-like equalities. Eur. J. Comb. Bostjan Bresar, Sandi Klavzar, Riste Skrekovski
2003	J	`jnl`	The Cube Polynomial and its Derivatives: the Case of Median Graphs. Electron. J. Comb. Bostjan Bresar, Sandi Klavzar, Riste Skrekovski
2003	J	`jnl`	The Petersen graph is not 3-edge-colorable--a new proof. Discret. Math. Reza Naserasr, Riste Skrekovski
2002	J	`jnl`	On the critical point-arboricity graphs. J. Graph Theory Riste Skrekovski
2002	J	`jnl`	Planar Graphs Without Cycles of Specific Lengths. Eur. J. Comb. Gasper Fijavz, Martin Juvan, Bojan Mohar, Riste Skrekovski
2002	J	`jnl`	Tiled partial cubes. J. Graph Theory Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski
2001	J	`jnl`	A note on choosability with separation for planar graphs. Ars Comb. Riste Skrekovski
2001	J	`jnl`	Cubes polynomial and its derivatives. Electron. Notes Discret. Math. Bostjan Bresar, Sandi Klavzar, Riste Skrekovski
2001	J	`jnl`	Gallai's innequality for critical graphs of reducible hereditary properties. Discuss. Math. Graph Theory Peter Mihók, Riste Skrekovski
2001	J	`jnl`	Nowhere-zero k-flows of Supergraphs. Electron. J. Comb. Bojan Mohar, Riste Skrekovski
2001	J	`jnl`	Two relations for median graphs. Discret. Math. Riste Skrekovski
2000	J	`jnl`	List improper colorings of planar graphs with prescribed girth. Discret. Math. Riste Skrekovski
2000	J	`jnl`	On median graphs and median grid graphs. Discret. Math. Sandi Klavzar, Riste Skrekovski
1999	J	`jnl`	A Grötzsch-Type Theorem For List Colourings With Impropriety One. Comb. Probab. Comput. Riste Skrekovski
1999	J	`jnl`	Graphs of degree 4 are 5-edge-choosable. J. Graph Theory Martin Juvan, Bojan Mohar, Riste Skrekovski
1999	J	`jnl`	The Grötzsch Theorem for the Hypergraph of Maximal Cliques. Electron. J. Comb. Bojan Mohar, Riste Skrekovski
1998	J	`jnl`	An Euler-type formula for median graphs. Discret. Math. Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski
1998	J	`jnl`	Choosability of K Discret. Math. Riste Skrekovski
1998	J	`jnl`	List Total Colourings of Graphs. Comb. Probab. Comput. Martin Juvan, Bojan Mohar, Riste Skrekovski
1998	J	`jnl`	On list edge-colorings of subcubic graphs. Discret. Math. Martin Juvan, Bojan Mohar, Riste Skrekovski