Eun-Kyung Cho

According to our database, Eun-Kyung Cho authored at least 11 papers between 2019 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

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, October, 2023

On independent domination of regular graphs.

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

J. Graph Theory, May, 2023

Odd coloring of sparse graphs and planar graphs.

Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park

Discret. Math., May, 2023

Independent domination of graphs with bounded maximum degree.

Eun-Kyung Cho, Jinha Kim, Minki Kim, Sang-il Oum

J. Comb. Theory B, 2023

2022

Decomposing planar graphs into graphs with degree restrictions.

Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park, Tingting Shan, Xuding Zhu

J. Graph Theory, 2022

Improvements on Hippchen's conjecture.

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

Discret. Math., 2022

2021

The strong clique index of a graph with forbidden cycles.

Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park

J. Graph Theory, 2021

Generalized List Colouring of Graphs.

Eun-Kyung Cho, Ilkyoo Choi, Yiting Jiang, Ringi Kim, Boram Park, Jiayan Yan, Xuding Zhu

Graphs Comb., 2021

On induced saturation for paths.

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

Eur. J. Comb., 2021

Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests.

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

Discret. Math., 2021

2019

A spectral characterisation of t-designs and its applications.

Eun-Kyung Cho, Cunsheng Ding, Jong Yoon Hyun

Adv. Math. Commun., 2019