R. Erman

Most-cited papers

1. Choosability of the square of a planar graph with maximum degree four

   Daniel W. Cranston, R. Erman, R. Škrekovski

   2013The Australasian Journal of Combinatorics26 citations

   Semantic Scholar

   Save

2. Improved induced matchings in sparse graphs

   R. Erman, Lukasz Kowalik, Matjaž Krnc, Tomasz Waleń

   2009Discrete Applied Mathematics22 citations Open access

   Semantic Scholar

   Save

3. Long cycles in fullerene graphs

   R. Erman, František Kardoš, Jozef Miskuf

   200910 citations Open access

   Semantic Scholar

   Save

4. 5-Coloring Graphs with 4 Crossings

   R. Erman, F. Havet, B. Lidický, Ondrej Pangrác

   2011SIAM Journal on Discrete Mathematics6 citations Open access

   Semantic Scholar

   Save

5. Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs

   R. Erman, Suzana Jurecic, D. Král', Kris Stopar +1 more

   2009SIAM Journal on Discrete Mathematics6 citations

   Semantic Scholar

   Save

6. Cyclic colorings of plane graphs with independent faces

   Jernej Azarija, R. Erman, D. Král', Matjaž Krnc +1 more

   2008European journal of combinatorics (Print)6 citations Open access

   Semantic Scholar

   Save

7. Linear colouring of planar graphs with prescribed girth and maximum degree

   R. Erman, R. Škrekovski

   20110 citations

   Semantic Scholar

   Save