Ilkyoo Choi

activity

20132022

most cited3-coloring triangle-free planar graphs with a precolored 9-cycle

5 citations · 12 across the 13 of their papers we have counts for

collaborators

25 papers

math.CO2022★ 5 cited

Proper conflict-free coloring of sparse graphs

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

A {\it proper conflict-free $c$ -coloring} of a graph is a proper $c$ -coloring such that each non-isolated vertex has a color appearing exactly once on its neighborhood. This notion…

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…

math.CO2020

Improvements on Hippchen's Conjecture

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

Let $G$ be a $k$ -connected graph on $n$ vertices. Hippchen's Conjecture states that two longest paths in $G$ share at least $k$ vertices. Gutiérrez recently proved the conjecture w…

math.CO2020

Decomposing planar graphs into graphs with degree restrictions

Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim +3

Given a graph $G$ , a decomposition of $G$ is a partition of its edges. A graph is $(d, h)$ -decomposable if its edge set can be partitioned into a $d$ -degenerate graph and a graph w…

math.CO2020★ 1 cited

The layer number of $α$ -evenly distributed point sets

Ilkyoo Choi, Weonyoung Joo, Minki Kim

For a finite point set in $R^{d}$ , we consider a peeling process where the vertices of the convex hull are removed at each step. The layer number $L (X)$ of a given point set…