1 citations · 1 across the 7 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
On strong odd colorings of sparse graphs
Ilkyoo Choi, Hojin Chu
A strong odd coloring of a graph is a proper vertex coloring such that for every vertex , each color appearing on the neighborhood of appears an odd number of times. We inve…
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…