The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Riste Skrekovski" ( http://dblp.L3S.de/Authors/Riste_Skrekovski )

  Author page on DBLP  Author page in RDF  Community of Riste Skrekovski in ASPL-2

Publication years (Num. hits)
1998-2003 (17) 2004-2006 (18) 2007-2009 (23) 2010-2012 (21)
Publication types (Num. hits)
article(77) inproceedings(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 79 publication records. Showing 79 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Martin Kochol, Riste Skrekovski Brooksʼ Theorem for generalized dart graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Martin Knor, Primoz Potocnik, Riste Skrekovski On a conjecture about Wiener index in iterated line graphs of trees. Search on Bibsonomy Discrete Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Mathieu Dutour Sikiric, Martin Knor, Primoz Potocnik, Jozef Sirán, Riste Skrekovski Hyperbolic analogues of fullerenes on orientable surfaces. Search on Bibsonomy Discrete Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorak, Bernard Lidický, Riste Skrekovski Bipartizing fullerenes. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Petr Gregor, Riste Skrekovski Parity vertex colorings of binomial trees. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2012 DBLP  BibTeX  RDF
1Petr Gregor, Riste Skrekovski, Vida Vukasinovic Queue Layouts of Hypercubes. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dávid Hudák, Frantisek Kardos, Borut Luzar, Roman Sotak, Riste Skrekovski Acyclic edge coloring of planar graphs with Δ colors. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Petr Gregor, Riste Skrekovski, Vida Vukasinovic On the queue-number of the hypercube. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorak, Bernard Lidický, Riste Skrekovski Randić index and the diameter of a graph. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorak, Bernard Lidický, Riste Skrekovski Graphs with Two Crossings Are 5-Choosable. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tomás Kaiser, Ondrej Rucký, Riste Skrekovski Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tomás Kaiser, Matej Stehlík, Riste Skrekovski On the 2-Resonance of Fullerenes. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk, Riste Skrekovski On the Zagreb index inequality of graphs with prescribed vertex degrees. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lukasz Kowalik, Borut Luzar, Riste Skrekovski An improved bound on the largest induced forests for triangle-free planar graphs. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2010 DBLP  BibTeX  RDF
1Louis Esperet, Daniel Král', Petr Skoda, Riste Skrekovski An improved linear bound on the number of perfect matchings in cubic graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski Facial colorings using Hall's Theorem. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Petr Gregor, Riste Skrekovski On generalized middle-level problem. Search on Bibsonomy Inf. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorak, Bernard Lidický, Riste Skrekovski 3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorak, Daniel Král', Riste Skrekovski Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jozef Miskuf, Riste Skrekovski, Martin Tancer Backbone colorings of graphs with bounded degree. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Martin Kochol, Riste Skrekovski Dichotomy for Coloring of Dart Graphs. Search on Bibsonomy IWOCA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Reza Naserasr, Yared Nigussie, Riste Skrekovski Homomorphisms of triangle-free graphs without a K5-minor. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorak, Bernard Lidický, Riste Skrekovski Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Borut Luzar, Riste Skrekovski, Martin Tancer Injective colorings of planar graphs with few colors. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Petr Gregor, Riste Skrekovski Long cycles in hypercubes with distant faulty vertices. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2009 DBLP  BibTeX  RDF
1Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski Gray Codes Avoiding Matchings. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2009 DBLP  BibTeX  RDF
1Jozef Miskuf, Riste Skrekovski, Martin Tancer Backbone Colorings and Generalized Mycielski Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorak, Riste Skrekovski k-Chromatic Number of Graphs on Surfaces. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorak, Daniel Král, Pavel Nejedlý, Riste Skrekovski Distance constrained labelings of planar graphs with no short cycles. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski Gray Code Compression. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorak, Daniel Král, Pavel Nejedlý, Riste Skrekovski Coloring squares of planar graphs with girth six. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tomás Kaiser, Riste Skrekovski Cycles Intersecting Edge-Cuts of Prescribed Sizes. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski 3-Facial Coloring of Plane Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorak, Riste Skrekovski, Martin Tancer List-Coloring Squares of Sparse Subcubic Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Lukasz Kowalik, Jean-Sébastien Sereni, Riste Skrekovski Total-Coloring of Plane Graphs with Maximum Degree Nine. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorak, Riste Skrekovski, T. Valla Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu The circular chromatic index of graphs of high girth. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Tomás Madaras, Riste Skrekovski Lightness, heaviness and gravity. Search on Bibsonomy Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Bostjan Bresar, Sandi Klavzar, Riste Skrekovski On cube-free median graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorak, Riste Skrekovski, T. Valla Four gravity results. Search on Bibsonomy Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Tomás Madaras, Riste Skrekovski, Heinz-Jürgen Voss The 7-cycle C7 is light in the family of planar graphs with minimum degree 5. Search on Bibsonomy Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Daniel Král, Tomás Madaras, Riste Skrekovski Cyclic, diagonal and facial colorings - a missing case. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Richard Cole, Lukasz Kowalik, Riste Skrekovski A Generalization of Kotzig's Theorem and Its Application. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Tomás Kaiser, Riste Skrekovski T-joins intersecting small edge-cuts in graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michael Stiebitz, Riste Skrekovski A map colour theorem for the union of graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Veselin Jungic, Daniel Král, Riste Skrekovski Colorings Of Plane Graphs With No Rainbow Faces. Search on Bibsonomy Combinatorica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C15
1Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski 3-facial colouring of plane graphs Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Zdenek Dvorak, Riste Skrekovski A Theorem About a Contractible and Light Edge. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Daniel Král, Riste Skrekovski, Martin Tancer Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Bostjan Bresar, Sandi Klavzar, Riste Skrekovski Roots of cube polynomials of median graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Daniel Král, Riste Skrekovski The last excluded case of Dirac's map-color theorem for choosability. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Primoz Potocnik, Martin Skoviera, Riste Skrekovski Nowhere-zero 3-flows in abelian Cayley graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Daniel Král, Tomás Madaras, Riste Skrekovski Cyclic, diagonal and facial colorings. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorak, Daniel Král, Riste Skrekovski Coloring face hypergraphs on surfaces. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Jirí Fiala, Daniel Král, Riste Skrekovski A Brooks-Type Theorem for the Generalized List T-Coloring. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West Nordhaus-Gaddum-type Theorems for decompositions into many parts. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Jirí Fiala, Riste Skrekovski Generalized list T-colorings of cycles. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Tomás Kaiser, Daniel Král, Riste Skrekovski A revival of the girth conjecture. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Tomás Madaras, Riste Skrekovski Heavy paths, light stars, and big melons. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Daniel Král, Riste Skrekovski Borodin's conjecture on diagonal coloring is false. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Tomás Kaiser, Riste Skrekovski Planar graph colorings without short monochromatic cycles. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Reza Naserasr, Riste Skrekovski The Petersen graph is not 3-edge-colorable--a new proof. Search on Bibsonomy Discrete Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Bostjan Bresar, Sandi Klavzar, Riste Skrekovski Quasi-median graphs, their generalizations, and tree-like equalities. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Bostjan Bresar, Sandi Klavzar, Riste Skrekovski The Cube Polynomial and its Derivatives: the Case of Median Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2003 DBLP  BibTeX  RDF
1Daniel Král, Riste Skrekovski A Theorem about the Channel Assignment Problem. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2003 DBLP  BibTeX  RDF
1Gasper Fijavz, Martin Juvan, Bojan Mohar, Riste Skrekovski Planar Graphs Without Cycles of Specific Lengths. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Bostjan Bresar, Sandi Klavzar, Riste Skrekovski Cubes polynomial and its derivatives. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Riste Skrekovski Two relations for median graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Bojan Mohar, Riste Skrekovski Nowhere-zero k-flows of Supergraphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2001 DBLP  BibTeX  RDF
1Riste Skrekovski A note on choosability with separation for planar graphs. Search on Bibsonomy Ars Comb. The full citation details ... 2001 DBLP  BibTeX  RDF
1Riste Skrekovski List improper colorings of planar graphs with prescribed girth. Search on Bibsonomy Discrete Mathematics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Sandi Klavzar, Riste Skrekovski On median graphs and median grid graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Bojan Mohar, Riste Skrekovski The Grötzsch Theorem for the Hypergraph of Maximal Cliques. Search on Bibsonomy Electr. J. Comb. The full citation details ... 1999 DBLP  BibTeX  RDF
1Riste Skrekovski A Grötzsch-Type Theorem For List Colourings With Impropriety One. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 1999 DBLP  BibTeX  RDF
1Martin Juvan, Bojan Mohar, Riste Skrekovski On list edge-colorings of subcubic graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski An Euler-type formula for median graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Riste Skrekovski Choosability of K5-minor-free graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Martin Juvan, Bojan Mohar, Riste Skrekovski List Total Colourings of Graphs. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 1998 DBLP  BibTeX  RDF
Displaying result #1 - #79 of 79 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.