Rok Erman

According to our database, Rok Erman authored at least 5 papers between 2009 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

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

Daniel W. Cranston, Rok Erman, Riste Skrekovski

Australas. J Comb., 2014

2012

Cyclic colorings of plane graphs with independent faces.

Jernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho

Eur. J. Comb., 2012

2011

5-Coloring Graphs with 4 Crossings.

Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrác

SIAM J. Discret. Math., 2011

2010

Improved induced matchings in sparse graphs.

Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen

Discret. Appl. Math., 2010

2009

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

Rok Erman, Suzana Jurecic, Daniel Král, Kris Stopar, Nik Stopar

SIAM J. Discret. Math., 2009