Searching for authors named "Riste Skrekovski" – sorted by Relevance.
-
T-joins intersecting small edge-cuts
- T -joins intersecting small edge-cuts in graphs Tomáˇs Kaiser ∗ Riste ˇ Skrekovski † Abstract
- Add To MetaCart
-
The Petersen graph is not 3-edge-colorable- a new proof
- The Petersen graph is not 3-edge-colorable - a new proof Reza Naserasr a Riste ˇ Skrekovski b
- Add To MetaCart
-
List Distance Labelings of Graphs
- List distance labelings of graphs Jir Fiala a and Riste Skrekovski ya;b a Charles University
- Add To MetaCart
-
The Last Excluded Case of Dirac's Map-Color Theorem for Choosability
- Skrekovski a;b; January 2004 a Department of Applied Mathematics and Institute for Theoretical Computer
- Add To MetaCart
-
Coloring the Clique Hypergraph of Graphs without Forbidden Structure
- , and Riste Skrekovski yb;c October 27, 2001 a CNRS - GeoD research group, Laboratoire Leibniz, 46 avenue
- Add To MetaCart
-
The Grötzsch Theorem for the hypergraph of maximal cliques
- The Grotzsch Theorem for the hypergraph of maximal cliques Bojan Mohar # and Riste Skrekovski
- Cited by 5 (0 self) – Add To MetaCart
-
List-colouring squares of sparse subcubic graphs
- List-Colouring Squares of Sparse Subcubic Graphs Zdeněk Dvoˇrák ∗ Riste ˇ Skrekovski † Martin
- Cited by 3 (1 self) – Add To MetaCart
-
Lightness, Heaviness and Gravity
- Lightness, heaviness and gravity Tomas Madaras a and Riste Skrekovski yb;c November 25, 2003 a
- Cited by 1 (0 self) – Add To MetaCart
-
A Map Colour Theorem for the Union of Graphs
- A Map Colour Theorem for the Union of Graphs Michael Stiebitz 1 Riste Skrekovski 2;3 1
- Cited by 2 (0 self) – Add To MetaCart
-
Injective colorings of planar graphs with few colors, DiscreteMath. To appear. [9] V.G. Vizing, Coloring the vertices of a graph in prescrived colors
- Injective colorings of planar graphs with few colors ∗ Borut Luˇzar 1 Riste ˇ Skrekovski 2† Martin
- Cited by 2 (0 self) – Add To MetaCart

