Odd coloring of sparse graphs and planar graphs. - Eun-Kyung Cho; Ilkyoo Choi; Hyemin Kwon; Boram Park (Discret. Math., 2023)

A tight bound for independent domination of cubic graphs without 4-cycles. - Eun-Kyung Cho; Ilkyoo Choi; Hyemin Kwon; Boram Park (J. Graph Theory, 2023)

Proper conflict-free coloring of sparse graphs. - Eun-Kyung Cho; Ilkyoo Choi; Hyemin Kwon; Boram Park (Discret. Appl. Math., 2025)

The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs. - James Anderson; Herman Chau; Eun-Kyung Cho; Nicholas Crawford; Stephen G. Hartke; Emily Heath; Owen Henderschedt; Hyemin Kwon; Zhiyuan Zhang (Discret. Math., 2025)

Brooks-type theorems for relaxations of square colorings. - Eun-Kyung Cho; Ilkyoo Choi; Hyemin Kwon; Boram Park (Discret. Math., 2025)