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

3 papers · 1 filter

math.CO2021★ 10 cited

Tight bound for independent domination of cubic graphs without $4$ -cycles

Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon +1

Given a graph $G$ , a dominating set of $G$ is a set $S$ of vertices such that each vertex not in $S$ has a neighbor in $S$ . The domination number of $G$ , denoted $γ (G)$ , is the min…

math.CO2021

On independent domination of regular graphs

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

Given a graph $G$ , a dominating set of $G$ is a set $S$ of vertices such that each vertex not in $S$ has a neighbor in $S$ . The domination number of $G$ , denoted $γ (G)$ , is the min…

math.CO2021

Brick partition problems in three dimensions

Ilkyoo Choi, Minseong Kim, Kiwon Seo

A $d$ -dimensional brick is a set $I_{1} \times \dots \times I_{d}$ where each $I_{i}$ is an interval. Given a brick $B$ , a brick partition of $B$ is a partition of $B$ into bricks. A bri…

Tight bound for independent domination of cubic graphs without 4-cycles

On independent domination of regular graphs

Brick partition problems in three dimensions

Tight bound for independent domination of cubic graphs without $4$ -cycles