Ilkyoo Choi

activity

20132026

most citedStrong edge-colorings of sparse graphs with large maximum degree

17 citations · 116 across the 43 of their papers we have counts for

collaborators

Showing 2013Show all

3 papers · 1 filter

math.CO2013★ 1 cited

Toroidal graphs containing neither $K_{5}^{-}$ nor 6-cycles are 4-choosable

Ilkyoo Choi

The choosability $χ_{ℓ} (G)$ of a graph $G$ is the minimum $k$ such that having $k$ colors available at each vertex guarantees a proper coloring. Given a toroidal graph $G$ , it is…

math.CO2013

Vertex Arboricity of Toroidal Graphs with a Forbidden Cycle

Ilkyoo Choi, Haihui Zhang

The vertex arboricity $a (G)$ of a graph $G$ is the minimum $k$ such that $V (G)$ can be partitioned into $k$ sets where each set induces a forest. For a planar graph $G$ , it is know…

math.CO2013★ 16 cited

On Choosability with Separation of Planar Graphs with Forbidden Cycles

Ilkyoo Choi, Bernard Lidický, Derrick Stolee

We study choosability with separation which is a constrained version of list coloring of graphs. A (k,d)-list assignment L on a graph G is a function that assigns to each vertex v…

Toroidal graphs containing neither K5−​ nor 6-cycles are 4-choosable

Vertex Arboricity of Toroidal Graphs with a Forbidden Cycle

On Choosability with Separation of Planar Graphs with Forbidden Cycles

Toroidal graphs containing neither $K_{5}^{-}$ nor 6-cycles are 4-choosable