The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Riste Skrekovski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  39. Gray Code Compression. [Citation Graph (, )][DBLP]


  40. Distance constrained labelings of planar graphs with no short cycles. [Citation Graph (, )][DBLP]


  41. Backbone colorings of graphs with bounded degree. [Citation Graph (, )][DBLP]


  42. Homomorphisms of triangle-free graphs without a K5-minor. [Citation Graph (, )][DBLP]


  43. Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. [Citation Graph (, )][DBLP]


  44. Injective colorings of planar graphs with few colors. [Citation Graph (, )][DBLP]


  45. Cyclic, diagonal and facial colorings - a missing case. [Citation Graph (, )][DBLP]


  46. Coloring squares of planar graphs with girth six. [Citation Graph (, )][DBLP]


  47. Facial colorings using Hall's Theorem. [Citation Graph (, )][DBLP]


  48. An improved linear bound on the number of perfect matchings in cubic graphs. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002