default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRiste Skrekovski
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j192]Martin Knor, Riste Skrekovski
, Slobodan Filipovski, Darko Dimitrov:
Extremizing antiregular graphs by modifying total σ-irregularity. Appl. Math. Comput. 490: 129199 (2025)- 2024
- [j191]Vesna Andova, Pavel Dimovski, Martin Knor, Riste Skrekovski:
Diameter of nanotori. Appl. Math. Comput. 462: 128342 (2024) - [j190]Jelena Sedlar, Riste Skrekovski:
Normal 5-edge-coloring of some snarks superpositioned by the Petersen graph. Appl. Math. Comput. 467: 128493 (2024) - [j189]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Selected topics on Wiener index. Ars Math. Contemp. 24(4): 4 (2024) - [j188]Iztok Peterin, Jelena Sedlar, Riste Skrekovski, Ismael G. Yero:
Resolving vertices of graphs with differences. Comput. Appl. Math. 43(5): 275 (2024) - [j187]Tomás Kaiser, Matej Stehlík, Riste Skrekovski:
Criticality in Sperner's Lemma. Comb. 44(5): 1041-1051 (2024) - [j186]Jelena Sedlar, Riste Skrekovski:
Local Irregularity Conjecture vs. cacti. Discret. Appl. Math. 343: 115-133 (2024) - [j185]Mirko Petrusevski, Riste Skrekovski:
Proper edge-colorings with a rich neighbor requirement. Discret. Math. 347(3): 113803 (2024) - [j184]Jelena Sedlar, Riste Skrekovski:
Normal 5-edge-coloring of some snarks superpositioned by Flower snarks. Eur. J. Comb. 122: 104038 (2024) - 2023
- [j183]Martin Knor, Riste Skrekovski:
On maximum Wiener index of directed grids. Art Discret. Appl. Math. 6(3): 3 (2023) - [j182]Mikita Akulich, Iztok Savnik, Matjaz Krnc, Riste Skrekovski:
Multiset-Trie Data Structure. Algorithms 16(3): 170 (2023) - [j181]Yair Caro, Mirko Petrusevski, Riste Skrekovski:
Remarks on proper conflict-free colorings of graphs. Discret. Math. 346(2): 113221 (2023) - [j180]Mirko Petrusevski, Riste Skrekovski:
Odd edge-colorings of subdivisions of odd graphs. J. Graph Theory 104(3): 585-610 (2023) - [j179]Reza Naserasr, Riste Skrekovski, Zhouningxin Wang, Rongxing Xu:
Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$. J. Graph Theory 104(3): 611-644 (2023) - 2022
- [j178]Nino Basic, Martin Knor, Riste Skrekovski:
On 12-regular nut graphs. Art Discret. Appl. Math. 5(2) (2022) - [j177]Jelena Sedlar, Riste Skrekovski:
Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two. Appl. Math. Comput. 427: 127147 (2022) - [j176]César Hernández-Cruz, Mirko Petrusevski, Riste Skrekovski:
Notes on weak-odd edge colorings of digraphs. Ars Math. Contemp. 22(2): 2 (2022) - [j175]Aleksander Kelenc, Aoden Teo Masa Toshi, Riste Skrekovski, Ismael G. Yero:
On metric dimensions of hypercubes. Ars Math. Contemp. 23(2) (2022) - [j174]Jelena Sedlar, Riste Skrekovski:
Vertex and edge metric dimensions of unicyclic graphs. Discret. Appl. Math. 314: 81-92 (2022) - [j173]Martin Knor, Riste Skrekovski, Ismael G. Yero:
A note on the metric and edge metric dimensions of 2-connected graphs. Discret. Appl. Math. 319: 454-460 (2022) - [j172]Jelena Sedlar, Riste Skrekovski:
Vertex and edge metric dimensions of cacti. Discret. Appl. Math. 320: 126-139 (2022) - [j171]Mirko Petrusevski, Riste Skrekovski:
Colorings with neighborhood parity condition. Discret. Appl. Math. 321: 385-391 (2022) - [j170]Yair Caro, Mirko Petrusevski, Riste Skrekovski:
Remarks on odd colorings of graphs. Discret. Appl. Math. 321: 392-401 (2022) - [j169]Mario Karlovcec, Matjaz Krnc, Riste Skrekovski:
Evaluating group degree centrality and centralization in networks. Informatica (Slovenia) 46(5) (2022) - [c5]Iztok Savnik, Kiyoshi Nitta, Riste Skrekovski, Nikolaus Augsten:
Statistics of RDF Store for Querying Knowledge Graphs. FoIKS 2022: 93-110 - [d1]Mikita Akulich, Iztok Savnik, Matjaz Krnc, Riste Skrekovski:
Multiset-trie data structure - datasets. Zenodo, 2022
- 2021
- [j168]Sasa Vujosevic, Goran Popivoda, Zana Kovijanic Vukicevic, Boris Furtula, Riste Skrekovski:
Arithmetic-geometric index and its relations with geometric-arithmetic index. Appl. Math. Comput. 391: 125706 (2021) - [j167]Jelena Sedlar, Riste Skrekovski:
Bounds on metric dimensions of graphs with edge disjoint cycles. Appl. Math. Comput. 396: 125908 (2021) - [j166]Martin Knor, Snjezana Majstorovic, Aoden Teo Masa Toshi, Riste Skrekovski, Ismael G. Yero:
Graphs with the edge metric dimension smaller than the metric dimension. Appl. Math. Comput. 401: 126076 (2021) - [j165]Jelena Sedlar, Riste Skrekovski:
Extremal mixed metric dimension with respect to the cyclomatic number. Appl. Math. Comput. 404: 126238 (2021) - [j164]Jelena Sedlar, Riste Skrekovski:
Mixed metric dimension of graphs with edge disjoint cycles. Discret. Appl. Math. 300: 1-8 (2021) - [j163]Kerry Ojakian, Riste Skrekovski, Aleksandra Tepeh:
Bounding the k-rainbow total domination number. Discret. Math. 344(8): 112425 (2021) - [j162]Mirko Petrusevski, Riste Skrekovski:
Odd decompositions and coverings of graphs. Eur. J. Comb. 91: 103225 (2021) - [j161]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Domination versus independent domination in regular graphs. J. Graph Theory 98(3): 525-530 (2021) - [i7]Iztok Savnik, Kiyoshi Nitta, Riste Skrekovski, Nikolaus Augsten:
Statistics of Knowledge Graphs Based On The Conceptual Schema. CoRR abs/2109.09391 (2021) - 2020
- [j160]Martin Knor, Jozef Komorník, Riste Skrekovski, Aleksandra Tepeh:
Some remarks on Balaban and sum-Balaban index. Art Discret. Appl. Math. 3(2) (2020) - [j159]Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
Maximal Wiener index for graphs with prescribed number of blocks. Appl. Math. Comput. 380: 125274 (2020) - [j158]François Pirot, Jean-Sébastien Sereni, Riste Skrekovski:
Variations on the Petersen Colouring Conjecture. Electron. J. Comb. 27(1): 1 (2020) - [j157]Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski:
Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs. Discret. Appl. Math. 284: 195-200 (2020) - [j156]Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma:
Eccentricity of networks with structural constraints. Discuss. Math. Graph Theory 40(4): 1141-1162 (2020) - [j155]Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
The structure of graphs with given number of blocks and the maximum Wiener index. J. Comb. Optim. 39(1): 170-184 (2020) - [j154]Risto Atanasov, Boris Furtula, Riste Skrekovski:
Trees with Minimum Weighted Szeged Index Are of a Large Diameter. Symmetry 12(5): 793 (2020) - [j153]Martin Knor, Muhammad Imran, Muhammad Kamran Jamil, Riste Skrekovski:
Remarks on Distance Based Topological Indices for ℓ-Apex Trees. Symmetry 12(5): 802 (2020) - [c4]Vida Vukasinovic, David Kubon, Riste Skrekovski, Petr Gregor:
Redundant binary representations with rigorous trade-off between connectivity and locality. GECCO Companion 2020: 325-326
2010 – 2019
- 2019
- [j152]Riste Skrekovski, Darko Dimitrov, Jiemei Zhong, Hualong Wu, Wei Gao:
Remarks on Multiplicative Atom-Bond Connectivity Index. IEEE Access 7: 76806-76811 (2019) - [j151]Martin Knor, Riste Skrekovski:
On the minimum distance in a k-vertex set in a graph. Appl. Math. Comput. 356: 99-104 (2019) - [j150]Qiang Sun, Barbara Ikica, Riste Skrekovski, Vida Vukasinovic:
Graphs with a given diameter that maximise the Wiener index. Appl. Math. Comput. 356: 438-448 (2019) - [j149]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Trees with the maximal value of Graovac-Pisanski index. Appl. Math. Comput. 358: 287-292 (2019) - [j148]Katarína Hrináková, Martin Knor, Riste Skrekovski:
An inequality between variable wiener index and variable szeged index. Appl. Math. Comput. 362 (2019) - [j147]Tomislav Doslic, Ivica Martinjak, Riste Skrekovski:
Total positivity of Toeplitz matrices of recursive hypersequences. Ars Math. Contemp. 17(1): 125-139 (2019) - [j146]Martin Knor, Jozef Komorník, Riste Skrekovski, Aleksandra Tepeh:
Unicyclic graphs with the maximal value of Graovac-Pisanski index. Ars Math. Contemp. 17(2): 455-466 (2019) - [j145]Darko Dimitrov, Barbara Ikica, Riste Skrekovski:
Maximum external Wiener index of graphs. Discret. Appl. Math. 257: 331-337 (2019) - [j144]Bernard Lidický, Kacy Messerschmidt, Riste Skrekovski:
Facial unique-maximum colorings of plane graphs with restriction on big vertices. Discret. Math. 342(9): 2612-2617 (2019) - [j143]Mirko Petrusevski, Riste Skrekovski:
Coverability of graph by three odd subgraphs. J. Graph Theory 92(3): 304-321 (2019) - [i6]Jan Bok, Boris Furtula, Nikola Jedlicková, Riste Skrekovski:
On Extremal Graphs of Weighted Szeged Index. CoRR abs/1901.04764 (2019) - [i5]Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
The structure of graphs with given number of blocks and the maximum Wiener index. CoRR abs/1905.02633 (2019) - [i4]Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski:
Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs. CoRR abs/1905.04291 (2019) - 2018
- [j142]Martin Knor, Katarína Hrináková, Riste Skrekovski:
On a conjecture about the ratio of Wiener index in iterated line graphs. Art Discret. Appl. Math. 1(1): #P1.09 (2018) - [j141]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Modelling simultaneous broadcasting by level-disjoint partitions. Appl. Math. Comput. 325: 15-23 (2018) - [j140]Martin Knor, Snjezana Majstorovic, Riste Skrekovski:
Graphs preserving Wiener index upon vertex removal. Appl. Math. Comput. 338: 25-32 (2018) - [j139]Petr Gregor, Tomás Novotný, Riste Skrekovski:
Extending Perfect Matchings to Gray Codes with Prescribed Ends. Electron. J. Comb. 25(2): 2 (2018) - [j138]Vesna Andova, Bernard Lidický, Borut Luzar, Riste Skrekovski:
On facial unique-maximum (edge-)coloring. Discret. Appl. Math. 237: 26-32 (2018) - [j137]Bernard Lidický, Kacy Messerschmidt, Riste Skrekovski:
A counterexample to a conjecture on facial unique-maximal colorings. Discret. Appl. Math. 237: 123-125 (2018) - [j136]Martin Knor, Snjezana Majstorovic, Riste Skrekovski:
Graphs whose Wiener index does not change when a specific vertex is removed. Discret. Appl. Math. 238: 126-132 (2018) - [j135]Snjezana Majstorovic, Martin Knor, Riste Skrekovski:
Graphs preserving total distance upon vertex removal. Electron. Notes Discret. Math. 68: 107-112 (2018) - [j134]Borut Luzar, Mirko Petrusevski, Riste Skrekovski:
On vertex-parity edge-colorings. J. Comb. Optim. 35(2): 373-388 (2018) - [j133]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Broadcasting multiple messages in the 1-in port model in optimal time. J. Comb. Optim. 36(4): 1333-1355 (2018) - 2017
- [j132]Darko Dimitrov, Barbara Ikica, Riste Skrekovski:
Remarks on the Graovac-Ghorbani index of bipartite graphs. Appl. Math. Comput. 293: 370-376 (2017) - [j131]Martin Knor, Jaka Kranjc, Riste Skrekovski, Aleksandra Tepeh:
On the minimum value of sum-Balaban index. Appl. Math. Comput. 303: 203-210 (2017) - [j130]Vesna Andova, Damir Orlic, Riste Skrekovski:
Leapfrog fullerenes and Wiener index. Appl. Math. Comput. 309: 281-288 (2017) - [j129]Marthe Bonamy, Martin Knor, Borut Luzar, Alexandre Pinlou, Riste Skrekovski:
On the difference between the Szeged and the Wiener index. Appl. Math. Comput. 312: 202-213 (2017) - [j128]Damir Vukicevic, Riste Skrekovski, Aleksandra Tepeh:
Relative edge betweenness centrality. Ars Math. Contemp. 12(2): 261-270 (2017) - [j127]Mirko Petrusevski, Riste Skrekovski:
A note on acyclic number of planar graphs. Ars Math. Contemp. 13(2): 317-322 (2017) - [j126]Darko Dimitrov, Barbara Ikica, Riste Skrekovski:
Remarks on maximum atom-bond connectivity index with given graph parameters. Discret. Appl. Math. 222: 222-226 (2017) - 2016
- [j125]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Some remarks on Wiener index of oriented graphs. Appl. Math. Comput. 273: 631-636 (2016) - [j124]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Digraphs with large maximum Wiener index. Appl. Math. Comput. 284: 260-267 (2016) - [j123]Martin Knor, Jaka Kranjc, Riste Skrekovski, Aleksandra Tepeh:
A search for the minimum value of Balaban index. Appl. Math. Comput. 286: 301-310 (2016) - [j122]Risto Atanasov, Mirko Petrusevski, Riste Skrekovski:
Odd edge-colorability of subcubic graphs. Ars Math. Contemp. 10(2): 359-370 (2016) - [j121]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Mathematical aspects of Wiener index. Ars Math. Contemp. 11(2): 327-352 (2016) - [j120]Vesna Andova, Frantisek Kardos, Riste Skrekovski:
Mathematical aspects of fullerenes. Ars Math. Contemp. 11(2): 353-379 (2016) - [j119]Jelena Govorcin, Riste Skrekovski, Vida Vukasinovic, Damir Vukicevic:
A measure for a balanced workload and its extremal values. Discret. Appl. Math. 200: 59-66 (2016) - [j118]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Orientations of graphs with maximum Wiener index. Discret. Appl. Math. 211: 121-129 (2016) - [j117]Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevski, Riste Skrekovski, Qiang Sun:
Mapping planar graphs into the Coxeter graph. Discret. Math. 339(2): 839-849 (2016) - [j116]L'udmila Bezegová, Borut Luzar, Martina Mockovciaková, Roman Soták, Riste Skrekovski:
Star Edge Coloring of Some Classes of Graphs. J. Graph Theory 81(1): 73-82 (2016) - [j115]Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma:
Closeness centralization measure for two-mode data of prescribed sizes. Netw. Sci. 4(4): 474-490 (2016) - [c3]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model. COCOA 2016: 144-158 - [i3]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Modelling simultaneous broadcasting by level-disjoint partitions. CoRR abs/1609.01116 (2016) - [i2]Darko Dimitrov, Barbara Ikica, Riste Skrekovski:
Remarks on the maximum atom-bond connectivity index of graphs with given parameters. CoRR abs/1610.02574 (2016) - 2015
- [j114]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Rooted level-disjoint partitions of Cartesian products. Appl. Math. Comput. 266: 244-258 (2015) - [j113]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
An inequality between the edge-Wiener index and the Wiener index of a graph. Appl. Math. Comput. 269: 714-721 (2015) - [j112]Borut Luzar, Riste Skrekovski:
Counterexamples to a conjecture on injective colorings. Ars Math. Contemp. 8(2): 291-295 (2015) - [j111]Darko Dimitrov, Riste Skrekovski:
Comparing the irregularity and the total irregularity of graphs. Ars Math. Contemp. 9(1): 45-50 (2015) - [j110]Borut Luzar, Mirko Petrusevski, Riste Skrekovski:
Odd edge coloring of graphs. Ars Math. Contemp. 9(2): 267-277 (2015) - [j109]Martin Knor, Borut Luzar, Riste Skrekovski:
Sandwiching the (generalized) Randić index. Discret. Appl. Math. 181: 160-166 (2015) - [j108]Borut Luzar, Martina Mockovciaková, Roman Soták, Riste Skrekovski, Peter Sugerek:
l-facial edge colorings of graphs. Discret. Appl. Math. 181: 193-200 (2015) - [j107]Matjaz Krnc, Riste Skrekovski:
Group centralization of network indices. Discret. Appl. Math. 186: 147-157 (2015) - [j106]Matjaz Krnc, Riste Skrekovski:
Centralization of transmission in networks. Discret. Math. 338(12): 2412-2420 (2015) - 2014
- [j105]Martin Knor, Riste Skrekovski:
Wiener index of generalized 4-stars and of their quadratic line graphs. Australas. J Comb. 58: 119-126 (2014) - [j104]Daniel W. Cranston, Rok Erman, Riste Skrekovski:
Choosability of the square of a planar graph with maximum degree four. Australas. J Comb. 59: 86-97 (2014) - [j103]Vida Vukasinovic, Jurij Silc, Riste Skrekovski:
Modeling acquaintance networks based on balance theory. Int. J. Appl. Math. Comput. Sci. 24(3): 683-696 (2014) - [j102]Jelena Govorcin, Riste Skrekovski:
On the connectivity of Cartesian product of graphs. Ars Math. Contemp. 7(2): 293-297 (2014) - [j101]Daniel W. Cranston, Riste Skrekovski:
Sufficient sparseness conditions for G2 to be (Δ+1)-choosable, when Δ≥5. Discret. Appl. Math. 162: 167-176 (2014) - [j100]Martin Knor, Primoz Potocnik, Riste Skrekovski:
Relationship between the edge-Wiener index and the Gutman index of a graph. Discret. Appl. Math. 167: 197-201 (2014) - [j99]Martin Knor, Martin Macaj, Primoz Potocnik, Riste Skrekovski:
Complete solution of equation W(L3(T))=W(T) for the Wiener index of iterated line graphs of trees. Discret. Appl. Math. 171: 90-103 (2014) - [j98]Dávid Hudák, Borut Luzar, Roman Soták, Riste Skrekovski:
Strong edge-coloring of planar graphs. Discret. Math. 324: 41-49 (2014) - [j97]Tomás Kaiser, Ondrej Rucký, Matej Stehlík, Riste Skrekovski:
Strong parity vertex coloring of plane graphs. Discret. Math. Theor. Comput. Sci. 16(1): 143-158 (2014) - [j96]Tomás Kaiser, Matej Stehlík, Riste Skrekovski:
Replication in critical graphs and the persistence of monomial ideals. J. Comb. Theory A 123(1): 239-251 (2014) - 2013
- [j95]Vesna Andova, Martin Knor, Primoz Potocnik, Riste Skrekovski:
On a variation of the Randíc index. Australas. J Comb. 56: 61-76 (2013) - [j94]Martin Knor, Primoz Potocnik, Riste Skrekovski:
Wiener index of iterated line graphs of trees homeomorphic to the claw K1, 3. Ars Math. Contemp. 6(2): 211-219 (2013) - [j93]Martin Knor, Primoz Potocnik, Riste Skrekovski:
Wiener index of iterated line graphs of trees homeomorphic to. Discret. Math. 313(10): 1104-1111 (2013) - [j92]Borut Luzar, Riste Skrekovski:
Improved bound on facial parity edge coloring. Discret. Math. 313(20): 2218-2222 (2013) - [j91]Marek Cygan, Marcin Pilipczuk, Riste Skrekovski:
A bound on the number of perfect matchings in Klee-graphs. Discret. Math. Theor. Comput. Sci. 15(1): 37-54 (2013) - [j90]Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski:
Linear time construction of a compressed Gray code. Eur. J. Comb. 34(1): 69-81 (2013) - [j89]Jelena Govorcin, Martin Knor, Riste Skrekovski:
Line graph operation and small worlds. Inf. Process. Lett. 113(5-6): 196-200 (2013) - [j88]Vida Vukasinovic, Petr Gregor, Riste Skrekovski:
On the mutually independent Hamiltonian cycles in faulty hypercubes. Inf. Sci. 236: 224-235 (2013) - 2012
- [j87]Vesna Andova, Nathann Cohen, Riste Skrekovski:
A note on Zagreb indices inequality for trees and unicyclic graphs. Ars Math. Contemp. 5(1): 73-76 (2012) - [j86]Dávid Hudák, Frantisek Kardos, Borut Luzar, Roman Soták, Riste Skrekovski:
Acyclic edge coloring of planar graphs with Δ colors. Discret. Appl. Math. 160(9): 1356-1368 (2012) - [j85]Jirí Fink, Borut Luzar, Riste Skrekovski:
Some remarks on inverse Wiener index problem. Discret. Appl. Math. 160(12): 1851-1858 (2012) - [j84]Martin Knor, Primoz Potocnik, Riste Skrekovski:
The Wiener index in iterated line graphs. Discret. Appl. Math. 160(15): 2234-2245 (2012) - [j83]Marcin Pilipczuk, Michal Pilipczuk, Riste Skrekovski:
Some results on Vizing's conjecture and related problems. Discret. Appl. Math. 160(16-17): 2484-2490 (2012) - [j82]Mathieu Dutour Sikiric, Martin Knor, Primoz Potocnik, Jozef Sirán, Riste Skrekovski:
Hyperbolic analogues of fullerenes on orientable surfaces. Discret. Math. 312(4): 729-736 (2012) - [j81]Martin Knor, Primoz Potocnik, Riste Skrekovski:
On a conjecture about Wiener index in iterated line graphs of trees. Discret. Math. 312(6): 1094-1105 (2012) - [j80]Petr Gregor, Riste Skrekovski:
Parity vertex colorings of binomial trees. Discuss. Math. Graph Theory 32(1): 177-180 (2012) - [j79]Zdenek Dvorák, Bernard Lidický, Riste Skrekovski:
Bipartizing fullerenes. Eur. J. Comb. 33(6): 1286-1293 (2012) - [j78]Martin Kochol, Riste Skrekovski:
Brooksʼ Theorem for generalized dart graphs. Inf. Process. Lett. 112(5): 200-204 (2012) - [j77]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Queue Layouts of Hypercubes. SIAM J. Discret. Math. 26(1): 77-88 (2012) - 2011
- [j76]Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk, Riste Skrekovski:
On the Zagreb index inequality of graphs with prescribed vertex degrees. Discret. Appl. Math. 159(8): 852-858 (2011) - [j75]Zdenek Dvorák, Bernard Lidický, Riste Skrekovski:
Randić index and the diameter of a graph. Eur. J. Comb. 32(3): 434-442 (2011) - [j74]Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
On the queue-number of the hypercube. Electron. Notes Discret. Math. 38: 413-418 (2011) - [j73]Tomás Kaiser, Ondrej Rucký, Riste Skrekovski:
Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable. SIAM J. Discret. Math. 25(3): 1069-1088 (2011) - [j72]Tomás Kaiser, Matej Stehlík, Riste Skrekovski:
On the 2-Resonance of Fullerenes. SIAM J. Discret. Math. 25(4): 1737-1745 (2011) - [j71]Zdenek Dvorák, Bernard Lidický, Riste Skrekovski:
Graphs with Two Crossings Are 5-Choosable. SIAM J. Discret. Math. 25(4): 1746-1753 (2011) - 2010
- [j70]Jozef Miskuf, Riste Skrekovski, Martin Tancer:
Backbone colorings of graphs with bounded degree. Discret. Appl. Math. 158(5): 534-542 (2010) - [j69]Lukasz Kowalik, Borut Luzar, Riste Skrekovski:
An improved bound on the largest induced forests for triangle-free planar graphs. Discret. Math. Theor. Comput. Sci. 12(1): 87-100 (2010) - [j68]Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski:
Facial colorings using Hall's Theorem. Eur. J. Comb. 31(3): 1001-1019 (2010) - [j67]Louis Esperet, Daniel Král', Petr Skoda, Riste Skrekovski:
An improved linear bound on the number of perfect matchings in cubic graphs. Eur. J. Comb. 31(5): 1316-1334 (2010) - [j66]Petr Gregor, Riste Skrekovski:
On generalized middle-level problem. Inf. Sci. 180(12): 2448-2457 (2010) - [j65]Zdenek Dvorák, Daniel Král', Riste Skrekovski:
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. J. Graph Theory 63(2): 129-145 (2010) - [j64]Zdenek Dvorák, Bernard Lidický, Riste Skrekovski:
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles. SIAM J. Discret. Math. 24(3): 934-945 (2010) - [c2]Martin Kochol, Riste Skrekovski:
Dichotomy for Coloring of Dart Graphs. IWOCA 2010: 82-89
2000 – 2009
- 2009
- [j63]Zdenek Dvorák, Daniel Král, Pavel Nejedlý, Riste Skrekovski:
Distance constrained labelings of planar graphs with no short cycles. Discret. Appl. Math. 157(12): 2634-2645 (2009) - [j62]Borut Luzar, Riste Skrekovski, Martin Tancer:
Injective colorings of planar graphs with few colors. Discret. Math. 309(18): 5636-5649 (2009) - [j61]Reza Naserasr, Yared Nigussie, Riste Skrekovski:
Homomorphisms of triangle-free graphs without a K5-minor. Discret. Math. 309(18): 5789-5798 (2009) - [j60]Zdenek Dvorák, Bernard Lidický, Riste Skrekovski:
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. Discret. Math. 309(20): 5899-5904 (2009) - [j59]Petr Gregor, Riste Skrekovski:
Long cycles in hypercubes with distant faulty vertices. Discret. Math. Theor. Comput. Sci. 11(1): 187-200 (2009) - [j58]Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski:
Gray Codes Avoiding Matchings. Discret. Math. Theor. Comput. Sci. 11(2): 123-148 (2009) - [j57]Zdenek Dvorák, Riste Skrekovski:
k-Chromatic Number of Graphs on Surfaces. SIAM J. Discret. Math. 23(1): 477-486 (2009) - [j56]Jozef Miskuf, Riste Skrekovski, Martin Tancer:
Backbone Colorings and Generalized Mycielski Graphs. SIAM J. Discret. Math. 23(2): 1063-1070 (2009) - [c1]Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski:
Gray Code Compression. IWOCA 2009: 183-193 - 2008
- [j55]Zdenek Dvorák, Daniel Král, Pavel Nejedlý, Riste Skrekovski:
Coloring squares of planar graphs with girth six. Eur. J. Comb. 29(4): 838-849 (2008) - [j54]Zdenek Dvorák, Riste Skrekovski, Martin Tancer:
List-Coloring Squares of Sparse Subcubic Graphs. SIAM J. Discret. Math. 22(1): 139-159 (2008) - [j53]Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski:
3-Facial Coloring of Plane Graphs. SIAM J. Discret. Math. 22(1): 231-247 (2008) - [j52]Zdenek Dvorák, Riste Skrekovski, Tomás Valla:
Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph. SIAM J. Discret. Math. 22(2): 568-591 (2008) - [j51]Tomás Kaiser, Riste Skrekovski:
Cycles Intersecting Edge-Cuts of Prescribed Sizes. SIAM J. Discret. Math. 22(3): 861-874 (2008) - [j50]Lukasz Kowalik, Jean-Sébastien Sereni, Riste Skrekovski:
Total-Coloring of Plane Graphs with Maximum Degree Nine. SIAM J. Discret. Math. 22(4): 1462-1479 (2008) - 2007
- [j49]Zdenek Dvorák, Riste Skrekovski, Tomás Valla:
Four gravity results. Discret. Math. 307(2): 181-190 (2007) - [j48]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
On cube-free median graphs. Discret. Math. 307(3-5): 345-351 (2007) - [j47]Tomás Madaras, Riste Skrekovski:
Lightness, heaviness and gravity. Discret. Math. 307(7-8): 939-951 (2007) - [j46]Tomás Madaras, Riste Skrekovski, Heinz-Jürgen Voss:
The 7-cycle C7 is light in the family of planar graphs with minimum degree 5. Discret. Math. 307(11-12): 1430-1435 (2007) - [j45]Daniel Král, Tomás Madaras, Riste Skrekovski:
Cyclic, diagonal and facial colorings - a missing case. Eur. J. Comb. 28(6): 1637-1639 (2007) - [j44]Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu:
The circular chromatic index of graphs of high girth. J. Comb. Theory B 97(1): 1-13 (2007) - [j43]Tomás Kaiser, Riste Skrekovski:
T-joins intersecting small edge-cuts in graphs. J. Graph Theory 56(1): 64-71 (2007) - [j42]Richard Cole, Lukasz Kowalik, Riste Skrekovski:
A Generalization of Kotzig's Theorem and Its Application. SIAM J. Discret. Math. 21(1): 93-106 (2007) - 2006
- [j41]Veselin Jungic, Daniel Král, Riste Skrekovski:
Colorings Of Plane Graphs With No Rainbow Faces. Comb. 26(2): 169-182 (2006) - [j40]Michael Stiebitz, Riste Skrekovski:
A map colour theorem for the union of graphs. J. Comb. Theory B 96(1): 20-37 (2006) - [j39]Daniel Král, Riste Skrekovski:
The last excluded case of Dirac's map-color theorem for choosability. J. Graph Theory 51(4): 319-354 (2006) - [j38]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
Roots of cube polynomials of median graphs. J. Graph Theory 52(1): 37-50 (2006) - [j37]Zdenek Dvorák, Riste Skrekovski:
A Theorem About a Contractible and Light Edge. SIAM J. Discret. Math. 20(1): 55-61 (2006) - [j36]Daniel Král, Riste Skrekovski, Martin Tancer:
Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings. SIAM J. Discret. Math. 20(2): 536-543 (2006) - [i1]Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski:
3-facial colouring of plane graphs. CoRR abs/cs/0607008 (2006) - 2005
- [j35]Jirí Fiala, Riste Skrekovski:
Generalized list T-colorings of cycles. Discret. Appl. Math. 148(1): 13-25 (2005) - [j34]Primoz Potocnik, Martin Skoviera, Riste Skrekovski:
Nowhere-zero 3-flows in abelian Cayley graphs. Discret. Math. 297(1-3): 119-127 (2005) - [j33]Zdenek Dvorák, Daniel Král, Riste Skrekovski:
Coloring face hypergraphs on surfaces. Eur. J. Comb. 26(1): 95-110 (2005) - [j32]Daniel Král, Tomás Madaras, Riste Skrekovski:
Cyclic, diagonal and facial colorings. Eur. J. Comb. 26(3-4): 473-490 (2005) - [j31]Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West:
Nordhaus-Gaddum-type Theorems for decompositions into many parts. J. Graph Theory 50(4): 273-292 (2005) - [j30]Jirí Fiala, Daniel Král, Riste Skrekovski:
A Brooks-Type Theorem for the Generalized List T-Coloring. SIAM J. Discret. Math. 19(3): 588-609 (2005) - 2004
- [j29]Tomás Madaras, Riste Skrekovski:
Heavy paths, light stars, and big melons. Discret. Math. 286(1-2): 115-131 (2004) - [j28]Daniel Král, Riste Skrekovski:
Borodin's conjecture on diagonal coloring is false. Eur. J. Comb. 25(6): 813-816 (2004) - [j27]Tomás Kaiser, Daniel Král, Riste Skrekovski:
A revival of the girth conjecture. J. Comb. Theory B 92(1): 41-53 (2004) - [j26]Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz:
Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. J. Graph Theory 45(4): 270-274 (2004) - [j25]Tomás Kaiser, Riste Skrekovski:
Planar graph colorings without short monochromatic cycles. J. Graph Theory 46(1): 25-38 (2004) - 2003
- [j24]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
The Cube Polynomial and its Derivatives: the Case of Median Graphs. Electron. J. Comb. 10 (2003) - [j23]Reza Naserasr, Riste Skrekovski:
The Petersen graph is not 3-edge-colorable--a new proof. Discret. Math. 268(1-3): 325-326 (2003) - [j22]Claude Benzaken, Sylvain Gravier, Riste Skrekovski:
Hajós' theorem for list colorings of hypergraphs. Discuss. Math. Graph Theory 23(2): 207-213 (2003) - [j21]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
Quasi-median graphs, their generalizations, and tree-like equalities. Eur. J. Comb. 24(5): 557-572 (2003) - [j20]Wilfried Imrich, Riste Skrekovski:
A theorem on integer flows on cartesian products of graphs. J. Graph Theory 43(2): 93-98 (2003) - [j19]Bojan Mohar, Riste Skrekovski, Heinz-Jürgen Voss:
Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9. J. Graph Theory 44(4): 261-295 (2003) - [j18]Daniel Král, Riste Skrekovski:
A Theorem about the Channel Assignment Problem. SIAM J. Discret. Math. 16(3): 426-437 (2003) - 2002
- [j17]Gasper Fijavz, Martin Juvan, Bojan Mohar, Riste Skrekovski:
Planar Graphs Without Cycles of Specific Lengths. Eur. J. Comb. 23(4): 377-388 (2002) - [j16]Riste Skrekovski:
On the critical point-arboricity graphs. J. Graph Theory 39(1): 50-61 (2002) - [j15]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski:
Tiled partial cubes. J. Graph Theory 40(2): 91-103 (2002) - 2001
- [j14]Riste Skrekovski:
A note on choosability with separation for planar graphs. Ars Comb. 58 (2001) - [j13]Bojan Mohar, Riste Skrekovski:
Nowhere-zero k-flows of Supergraphs. Electron. J. Comb. 8(1) (2001) - [j12]Riste Skrekovski:
Two relations for median graphs. Discret. Math. 226(1-3): 351-353 (2001) - [j11]Peter Mihók, Riste Skrekovski:
Gallai's innequality for critical graphs of reducible hereditary properties. Discuss. Math. Graph Theory 21(2): 167-177 (2001) - [j10]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
Cubes polynomial and its derivatives. Electron. Notes Discret. Math. 10: 47-49 (2001) - 2000
- [j9]Riste Skrekovski:
List improper colorings of planar graphs with prescribed girth. Discret. Math. 214(1-3): 221-233 (2000) - [j8]Sandi Klavzar, Riste Skrekovski:
On median graphs and median grid graphs. Discret. Math. 219(1-3): 287-293 (2000)
1990 – 1999
- 1999
- [j7]Bojan Mohar, Riste Skrekovski:
The Grötzsch Theorem for the Hypergraph of Maximal Cliques. Electron. J. Comb. 6 (1999) - [j6]Riste Skrekovski:
A Grötzsch-Type Theorem For List Colourings With Impropriety One. Comb. Probab. Comput. 8(5): 493-507 (1999) - [j5]Martin Juvan, Bojan Mohar, Riste Skrekovski:
Graphs of degree 4 are 5-edge-choosable. J. Graph Theory 32(3): 250-264 (1999) - 1998
- [j4]Martin Juvan, Bojan Mohar, Riste Skrekovski:
List Total Colourings of Graphs. Comb. Probab. Comput. 7(2): 181-188 (1998) - [j3]Martin Juvan, Bojan Mohar, Riste Skrekovski:
On list edge-colorings of subcubic graphs. Discret. Math. 187(1-3): 137-149 (1998) - [j2]Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski:
An Euler-type formula for median graphs. Discret. Math. 187(1-3): 255-258 (1998) - [j1]Riste Skrekovski:
Choosability of K5-minor-free graphs. Discret. Math. 190(1-3): 223-226 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
