Preprinti IMFM

Avtor: Riste Škrekovski

1159: Jiří Fink, Borut Lužar, Riste Škrekovski: Some remarks on inverse Wiener index problem, 49 (2011)

1158: Vida Vukašinović, Petr Gregor, Riste Škrekovski: On the mutually independent Hamiltonian cycles in faulty hypercubes, 49 (2011)

1157: Jernej Azarija, Riste Škrekovski: Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees, 49 (2011)

1156: Vesna Andova, Martin Knor, Primož Potočnik, Riste Škrekovski: On a variation of Randić index, 49 (2011)

1155: Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski: Bipartizing fullerenes, 49 (2011)

1154: Vesna Andova, Darko Dimitrov, Jiří Fink, Riste Škrekovski: Bounds on Gutman index, 49 (2011)

1153: Petr Gregor, Riste Škrekovski, Vida Vukašinović: Queue layouts of hypercubes, 49 (2011)

1146: Petr Gregor, Riste Škrekovski: Parity vertex colorings of binomial trees, 49 (2011)

1145: Martin Knor, Primož Potočnik, Riste Škrekovski: Relationship between edge-Wiener index and Gutman index of a graph, 49 (2011)

1144: Tomáš Kaiser, Andřej Rucký, Matěj Stehlík, Riste Škrekovski: Strong parity vertex coloring of plane graphs, 49 (2011)

1143: Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski: Graphs with two crossings are 5-choosable, 49 (2011)

1142: Rok Erman, Riste Škrekovski: Linear colouring of planar graphs with prescribed girth and maximum degree, 49 (2011)

1141: Marek Cygan, Marcin Pilipczuk, Riste Škrekovski: On the inequality between radius and Randić index for graphs, 49 (2011)

1133: Martin Knor, Primož Potočnik, Riste Škrekovski: On a conjecture about Wiener index in iterated line graphs of trees, 48 (2010)

1130: Marek Cygan, Michał Pilipczuk, Riste Škrekovski: Relation between Randić index and average distance of trees, 48 (2010)

1128: Riste Škrekovski, Primož Potočnik, Martin Knor: Wiener index in iterated line graphs, 48 (2010)

1123: Riste Škrekovski, Roman Soták, Borut Lužar, František Kardoš, Dávid Hudák: Acyclic edge coloring of planar graphs with Δ colors, 48 (2010)

1120: Riste Škrekovski, Marcin Pilipczuk, Darko Dimitrov, Sašo Bogoev, Vesna Andova: On the Zagreb index inequality of graphs with prescribed vertex degrees, 48 (2010)

1118: Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski: Randić index and the diameter of a graph, 48 (2010)

1116: Martin Kochol, Riste Škrekovski: Brooks theorem for dart graphs, 48 (2010)

1114: Riste Škrekovski, Matěj Stehlík, Tomáš Kaiser: On the 2-resonance of fullerenes, 48 (2010)

1113: Nathann Cohen, Darko Dimitrov, Roi Krakovski, Riste Škrekovski, Vida Vukašinović: On Wiener index of graphs and their line graphs, 48 (2010)

1108: Vesna Andova, Nathann Cohen, Riste Škrekovski: Some classes of graphs (dis)satisfying the Zagreb indices inequality, 47 (2009)

1105: Marek Cygan, Marcin Pilipczuk, Riste Škrekovski: A bound on the number of perfect matchings in klee-graphs, 47 (2009)

1097: Tomáš Kaiser, Andřej Rucký, Riste Škrekovski: Graphs with odd cycle lengths 5 and 7 are 3-colorable, 47 (2009)

1092: Łukasz Kowalik, Borut Lužar, Riste Škrekovski: An improved bound on the largest induced forests for triangle-free planar graphs, 47 (2009)

1091: Martin Knor, Primož Potočnik, Jozef Širáň, Riste Škrekovski: Hyperbolic analogues of fullerenes on orienatable surfaces, 47 (2009)

1085: Darko Dimitrov, Tomáš Dvořák, Petr Gregor, Riste Škrekovski: Gray code compression, 47 (2009)

1083: František Kardoš, Matjaž Krnc, Borut Lužar, Riste Škrekovski: Cyclic 7-edge-cuts in fullerene graphs, 47 (2009)

1081: Louis Esperet, Daniel Král', Petr Škoda, Riste Škrekovski: An improved linear bound on the number of perfect matchings in cubic graphs, 47 (2009)

1080: Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski: 3-choosability of triangle-free planar graphs with constraint on 4-cycles, 47 (2009)

1061: Riste Škrekovski, Petr Gregor: On Generalized Middle Level Problem, 46 (2008)

1060: Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski: Planar graphs without 3-,7-, and 8-cycles are 3-choosable , 46 (2008)

1053: Petr Gregor, Riste Škrekovski: Long cycles in hypercubes with distant faulty vertices, 46 (2008)

1050: Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Škrekovski: Facial colorings using Hall's Theorem, 46 (2008)

1044: Jozef Miškuf, Riste Škrekovski, Martin Tancer: Backbone colorings and generalized Mycielski’s graphs, 46 (2008)

1043: Jozef Miškuf, Riste Škrekovski, Martin Tancer: Backbone colorings of graphs with bounded degree, 46 (2008)

1040: Daniel Král', Ondřej Pangrác, Jean-Sébastien Sereni, Riste Škrekovski: Long cycles in fullerene graphs, 46 (2008)

1036: Darko Dimitrov, Tomáš Dvořák, Petr Gregor, Riste Škrekovski: Gray codes faulting matchings, 45 (2007)

1035: Łukasz Kowalik, Jean-Sébastien Sereni, Riste Škrekovski: Total-colouring of plane graphs with maximum degree nine, 45 (2007)

1034: Zdeněk Dvořák, Riste Škrekovski: k-chromatic number of graphs and surfaces, 45 (2007)

1031: František Kardoš, Riste Škrekovski: Cyclic edge-cuts in fullerene graphs, 45 (2007)

1030: Zdeněk Dvořák, Daniel Král', Riste Škrekovski: Non-rainbow colorings of 3-, 4- and 5-connected plane graphs, 45 (2007)

1022: Borut Lužar, Riste Škrekovski, Martin Tancer: Injective colorings of planar graphs with few colors, 44 (2006)

1014: Frédéric Havet, Jean-Sébastien Sereni, Riste Škrekovski: 3-facial colouring of plane graphs, 44 (2006)

1001: Zdeněk Dvořák, Riste Škrekovski, T. Valla: Planar graphs of odd-girth at least 9 are homomorphic to Petersen graph, 44 (2006)

999: Richard Cole, Łukasz Kowalik, Riste Škrekovski: A generalization of Kotzig's theorem and its application, 43 (2005)

996: Tomáš Kaiser, Riste Škrekovski: T-joins intersecting small edge-cuts in graphs, 43 (2005)

995: Reza Naserasr, Yared Nigussie, Riste Škrekovski: Homomorphisms of triangle-free graphs without a K5-minor, 43 (2005)

985: Zdeněk Dvořák, Riste Škrekovski, Martin Tancer: List-colouring squares of sparse subcubic graphs, 43 (2005)

976: Zdeněk Dvořák, Daniel Král', Pavel Nejedlý, Riste Škrekovski: Coloring squares of planar graphs with no short cycles, 43 (2005)

958: Daniel Král', Riste Škrekovski, Martin Tancer: Construction of large graphs with no optimal surjective L(2,1)-labelings, 43 (2005)

955: Zdeněk Dvořák, Riste Škrekovski: A theorem about a contractible and light edge, 43 (2005)

951: Tomáš Kaiser, Riste Škrekovski: Cycles intersecting edge-cuts of prescribed sizes, 42 (2004)

937: Tomáš Kaiser, Daniel Král', Riste Škrekovski, Xuding Zhu: The circular chromatic index of graphs of high girth, 42 (2004)

929: Zdeněk Dvořák, Riste Škrekovski, T. Valla: Four gravity results, 42 (2004)

913: Daniel Král', Riste Škrekovski: The last excluded case of Dirac's map-color theorem for choosability, 42 (2004)

902: Jiří Fiala, Daniel Král', Riste Škrekovski: A Brooks-type theorem for the generalized list $T$-coloring, 41 (2003)

899: Tomáš Madaras, Riste Škrekovski: Lightness, heaviness and gravity, 41 (2003)

898: Tomáš Kaiser, Daniel Král', Riste Škrekovski: A revival of the girth conjecture, 41 (2003)

891: Michael Stiebitz, Riste Škrekovski: A map colour theorem for the union of graphs, 41 (2003)

890: Sylvain Gravier, Riste Škrekovski: Coloring the clique hypergraph of graphs without forbidden structure, 41 (2003)

887: Boštjan Brešar, Sandi Klavžar, Riste Škrekovski: Roots of cube polynomials of median graphs, 41 (2003)

886: Boštjan Brešar, Sandi Klavžar, Riste Škrekovski: On cube-free median graphs, 41 (2003)

868: Veselin Jungić, Daniel Král', Riste Škrekovski: Colorings of plane graphs with no rainbow faces, 41 (2003)

867: Reza Naserasr, Riste Škrekovski: The Petersen graph is not 3-edge-colorable - a counting argument proof, 41 (2003)

866: Zoltan Füredi, Alexandr V. Kostochka, Michael Stiebitz, Riste Škrekovski, Douglas B. West: Nordhaus-Gaddum-type theorems for decompositions into many parts, 41 (2003)

822: Primož Potočnik, Martin Škoviera, Riste Škrekovski: Nowhere-zero 3-flows in Cayley graphs of Abelian groups, 40 (2002)

819: Jiří Fiala, Riste Škrekovski: List distance-labelings of graphs, 40 (2002)

817: Tomáš Kaiser, Riste Škrekovski: Planar graph colorings without short monochromatic cycles, 40 (2002)

816: Daniel Král', Riste Škrekovski: A theorem about the channel assignment problem, 40 (2002)

815: Tomáš Madaras, Riste Škrekovski: Heavy paths, light stars, and big melons, 40 (2002)

814: Claude Benzaken, Sylvain Gravier, Riste Škrekovski: Hajós' theorem for list colorings of hypergraphs, 40 (2002)

784: Thomas Böhme, Bojan Mohar, Riste Škrekovski, Michael Stiebitz: Subdivisions of large complete bipartite graphs and long induced paths in $k$-connected graphs, 39 (2001)

759: Peter Mihók, Riste Škrekovski: Gallai's inequality for critical graphs of reducible hereditary properties, 39 (2001)

745: Boštjan Brešar, Sandi Klavžar, Riste Škrekovski: Cubes polynomial and its derivatives, 39 (2001)

735: Gašper Fijavž, Martin Juvan, Bojan Mohar, Riste Škrekovski: Planar graphs without cycles of specific lengths, 39 (2001)

722: Bojan Mohar, Riste Škrekovski, H.-J. Voss: Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9, 38 (2000)

689: Bojan Mohar, Riste Škrekovski: Nowhere-zero $k$-flows of supgraphs, 38 (2000)

631: Bojan Mohar, Riste Škrekovski: The Grötzsch theorems for the hypergraph of maximal cliques, 36 (1998)

612: Wifried Imrich, Sandi Klavžar, Henry Martyn Mulder, Riste Škrekovski: Relations between median graphs, semi-median graphs and partial cubes, 36 (1998)

611: Sandi Klavžar, Riste Škrekovski, Aleksander Vesel: Square-edge graphs, partial cubes and their subclasses, 36 (1998)