249 citations
- Seoul National UniversityKR12 papers
- Korea Institute for Advanced StudyKR8 papers
- Sungkyunkwan UniversityKR7 papers
- Korea Advanced Institute of Science and TechnologyKR6 papers
- Institute for Basic ScienceKR5 papers
- Hankuk University of Foreign StudiesKR4 papers
- Novo Nordisk (Denmark)DK4 papers
- Pohang University of Science and TechnologyKR4 papers
- Umeå UniversitySE4 papers
- Yonsei UniversityKR4 papers
- Hanyang UniversityKR3 papers
- Korea Institute of Science & Technology InformationKR3 papers
4 papers · 1 filter
On independent domination of regular graphs
Eun-Kyung Cho, Ilkyoo Choi, Boram Park
Given a graph , a dominating set of is a set of vertices such that each vertex not in has a neighbor in . The domination number of , denoted , is the min…
Generalized list colouring of graphs
Eun-Kyung Cho, Ilkyoo Choi, Yiting Jiang +4
This paper disproves a conjecture of Wang, Wu, Yan and Xie, and answers in negative a question in Dvorak, Pekarek and Sereni. In return, we pose five open problems.
On induced saturation for paths
Eun-Kyung Cho, Ilkyoo Choi, Boram Park
For a graph , a graph is -induced-saturated if does not contain an induced copy of , but either removing an edge from or adding a non-edge to creates an in…
Largest 2-regular subgraphs in 3-regular graphs
Ilkyoo Choi, Ringi Kim, Alexandr Kostochka +2
For a graph , let denote the largest number of vertices in a -regular subgraph of . We determine the minimum of over -regular -vertex simple graphs…