most citedChoosability of the square of a planar graph with maximum degree four

11 citations · 11 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2013★ 11 cited

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

Daniel W. Cranston, Rok Erman, Riste Škrekovski

We study squares of planar graphs with the aim to determine their list chromatic number. We present new upper bounds for the square of a planar graph with maximum degree .…

math.CO2008

Cyclic colorings of plane graphs with independent faces

Jernej Azarija, Daniel Král', Rok Erman +2

Let G be a plane graph with maximum face size D. If all faces of G with size four or more are vertex disjoint, then G has a cyclic coloring with D+1 colors, i.e., a coloring such t…