5 citations · 5 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2026
Existence of cycles of length divisible by 3 or 4
Ilkyoo Choi, Hojin Chu, Ringi Kim +1
Dean conjectured that for each integer , every graph with minimum degree at least has a cycle whose length is divisible by ; this conjecture is known to be true for…
math.CO2022★ 5 cited
Proper conflict-free coloring of sparse graphs
Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon +1
A {\it proper conflict-free -coloring} of a graph is a proper -coloring such that each non-isolated vertex has a color appearing exactly once on its neighborhood. This notion…