| 2007 |
|---|
| 39 | EE | 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.
Discrete Mathematics 307(11-12): 1430-1435 (2007) |
| 38 | EE | Zdenek Dvorak,
Riste Skrekovski,
T. Valla:
Four gravity results.
Discrete Mathematics 307(2): 181-190 (2007) |
| 37 | EE | Bostjan Bresar,
Sandi Klavzar,
Riste Skrekovski:
On cube-free median graphs.
Discrete Mathematics 307(3-5): 345-351 (2007) |
| 36 | EE | Tomás Madaras,
Riste Skrekovski:
Lightness, heaviness and gravity.
Discrete Mathematics 307(7-8): 939-951 (2007) |
| 35 | EE | Daniel Král,
Tomás Madaras,
Riste Skrekovski:
Cyclic, diagonal and facial colorings - a missing case.
Eur. J. Comb. 28(6): 1637-1639 (2007) |
| 34 | EE | Tomás Kaiser,
Daniel Král,
Riste Skrekovski,
Xuding Zhu:
The circular chromatic index of graphs of high girth.
J. Comb. Theory, Ser. B 97(1): 1-13 (2007) |
| 2006 |
|---|
| 33 | EE | Frédéric Havet,
Jean-Sébastien Sereni,
Riste Skrekovski:
3-facial colouring of plane graphs
CoRR abs/cs/0607008: (2006) |
| 32 | EE | Veselin Jungic,
Daniel Král,
Riste Skrekovski:
Colorings Of Plane Graphs With No Rainbow Faces.
Combinatorica 26(2): 169-182 (2006) |
| 31 | EE | Michael Stiebitz,
Riste Skrekovski:
A map colour theorem for the union of graphs.
J. Comb. Theory, Ser. B 96(1): 20-37 (2006) |
| 30 | EE | Daniel Král,
Riste Skrekovski:
The last excluded case of Dirac's map-color theorem for choosability.
Journal of Graph Theory 51(4): 319-354 (2006) |
| 29 | EE | Bostjan Bresar,
Sandi Klavzar,
Riste Skrekovski:
Roots of cube polynomials of median graphs.
Journal of Graph Theory 52(1): 37-50 (2006) |
| 28 | EE | Zdenek Dvorak,
Riste Skrekovski:
A Theorem About a Contractible and Light Edge.
SIAM J. Discrete Math. 20(1): 55-61 (2006) |
| 2005 |
|---|
| 27 | EE | Jirí Fiala,
Riste Skrekovski:
Generalized list T-colorings of cycles.
Discrete Applied Mathematics 148(1): 13-25 (2005) |
| 26 | EE | Primoz Potocnik,
Martin Skoviera,
Riste Skrekovski:
Nowhere-zero 3-flows in abelian Cayley graphs.
Discrete Mathematics 297(1-3): 119-127 (2005) |
| 25 | EE | Zdenek Dvorak,
Daniel Král,
Riste Skrekovski:
Coloring face hypergraphs on surfaces.
Eur. J. Comb. 26(1): 95-110 (2005) |
| 24 | EE | Daniel Král,
Tomás Madaras,
Riste Skrekovski:
Cyclic, diagonal and facial colorings.
Eur. J. Comb. 26(3-4): 473-490 (2005) |
| 23 | EE | Zoltán Füredi,
Alexandr V. Kostochka,
Riste Skrekovski,
Michael Stiebitz,
Douglas B. West:
Nordhaus-Gaddum-type Theorems for decompositions into many parts.
Journal of Graph Theory 50(4): 273-292 (2005) |
| 22 | EE | Jirí Fiala,
Daniel Král,
Riste Skrekovski:
A Brooks-Type Theorem for the Generalized List T-Coloring.
SIAM J. Discrete Math. 19(3): 588-609 (2005) |
| 2004 |
|---|
| 21 | EE | Tomás Madaras,
Riste Skrekovski:
Heavy paths, light stars, and big melons.
Discrete Mathematics 286(1-2): 115-131 (2004) |
| 20 | EE | Daniel Král,
Riste Skrekovski:
Borodin's conjecture on diagonal coloring is false.
Eur. J. Comb. 25(6): 813-816 (2004) |
| 19 | EE | Tomás Kaiser,
Daniel Král,
Riste Skrekovski:
A revival of the girth conjecture.
J. Comb. Theory, Ser. B 92(1): 41-53 (2004) |
| 18 | EE | Thomas Böhme,
Bojan Mohar,
Riste Skrekovski,
Michael Stiebitz:
Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs.
Journal of Graph Theory 45(4): 270-274 (2004) |
| 17 | EE | Tomás Kaiser,
Riste Skrekovski:
Planar graph colorings without short monochromatic cycles.
Journal of Graph Theory 46(1): 25-38 (2004) |
| 2003 |
|---|
| 16 | EE | Reza Naserasr,
Riste Skrekovski:
The Petersen graph is not 3-edge-colorable--a new proof.
Discrete Mathematics 268(1-3): 325-326 (2003) |
| 15 | EE | Bostjan Bresar,
Sandi Klavzar,
Riste Skrekovski:
The Cube Polynomial and its Derivatives: the Case of Median Graphs.
Electr. J. Comb. 10: (2003) |
| 14 | EE | Bostjan Bresar,
Sandi Klavzar,
Riste Skrekovski:
Quasi-median graphs, their generalizations, and tree-like equalities.
Eur. J. Comb. 24(5): 557-572 (2003) |
| 13 | EE | Daniel Král,
Riste Skrekovski:
A Theorem about the Channel Assignment Problem.
SIAM J. Discrete Math. 16(3): 426-437 (2003) |
| 2002 |
|---|
| 12 | EE | Gasper Fijavz,
Martin Juvan,
Bojan Mohar,
Riste Skrekovski:
Planar Graphs Without Cycles of Specific Lengths.
Eur. J. Comb. 23(4): 377-388 (2002) |
| 2001 |
|---|
| 11 | | Riste Skrekovski:
A note on choosability with separation for planar graphs.
Ars Comb. 58: (2001) |
| 10 | EE | Riste Skrekovski:
Two relations for median graphs.
Discrete Mathematics 226(1-3): 351-353 (2001) |
| 9 | EE | Bojan Mohar,
Riste Skrekovski:
Nowhere-zero k-flows of Supergraphs.
Electr. J. Comb. 8(1): (2001) |
| 2000 |
|---|
| 8 | EE | Riste Skrekovski:
List improper colorings of planar graphs with prescribed girth.
Discrete Mathematics 214(1-3): 221-233 (2000) |
| 7 | EE | Sandi Klavzar,
Riste Skrekovski:
On median graphs and median grid graphs.
Discrete Mathematics 219(1-3): 287-293 (2000) |
| 1999 |
|---|
| 6 | | Riste Skrekovski:
A Grötzsch-Type Theorem For List Colourings With Impropriety One.
Combinatorics, Probability & Computing 8(5): (1999) |
| 5 | EE | Bojan Mohar,
Riste Skrekovski:
The Grötzsch Theorem for the Hypergraph of Maximal Cliques.
Electr. J. Comb. 6: (1999) |
| 1998 |
|---|
| 4 | | Martin Juvan,
Bojan Mohar,
Riste Skrekovski:
List Total Colourings of Graphs.
Combinatorics, Probability & Computing 7(2): 181-188 (1998) |
| 3 | EE | Martin Juvan,
Bojan Mohar,
Riste Skrekovski:
On list edge-colorings of subcubic graphs.
Discrete Mathematics 187(1-3): 137-149 (1998) |
| 2 | EE | Sandi Klavzar,
Henry Martyn Mulder,
Riste Skrekovski:
An Euler-type formula for median graphs.
Discrete Mathematics 187(1-3): 255-258 (1998) |
| 1 | EE | Riste Skrekovski:
Choosability of K5-minor-free graphs.
Discrete Mathematics 190(1-3): 223-226 (1998) |
