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 2016Show all

3 papers · 1 filter

math.CO2016★ 17 cited

Strong edge-colorings of sparse graphs with large maximum degree

Ilkyoo Choi, Jaehoon Kim, Alexandr V. Kostochka +1

A {\em strong $k$ -edge-coloring} of a graph $G$ is a mapping from $E (G)$ to ${1, 2, \dots, k}$ such that every two adjacent edges or two edges adjacent to the same edge receive dis…

math.CO2016

On tiling the integers with $4$ -sets of the same gap sequence

Ilkyoo Choi, Junehyuk Jung, Minki Kim

Partitioning a set into similar, if not, identical, parts is a fundamental research topic in combinatorics. The question of partitioning the integers in various ways has been consi…

math.CO2016★ 10 cited

Improper coloring of graphs on surfaces

Ilkyoo Choi, Louis Esperet

A graph $G$ is $(d_{1}, \dots, d_{k})$ -colorable if its vertex set can be partitioned into $k$ sets $V_{1}, \dots, V_{k}$ , such that for each $i \in {1, \dots, k}$ , the subgraph of $G$ indu…

Strong edge-colorings of sparse graphs with large maximum degree

On tiling the integers with 4-sets of the same gap sequence

Improper coloring of graphs on surfaces

On tiling the integers with $4$ -sets of the same gap sequence