17 citations · 116 across the 43 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.CO2022
Relaxation of Wegner's Planar Graph Conjecture for maximum degree 4
Eun-Kyung Cho, Ilkyoo Choi, Bernard Lidický
The famous Wegner's Planar Graph Conjecture asserts tight upper bounds on the chromatic number of the square of a planar graph , depending on the maximum degree of…
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…
math.CO2022★ 1 cited
Odd coloring of sparse graphs and planar graphs
Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon +1
An {\it odd -coloring} of a graph is a proper -coloring such that each non-isolated vertex has a color appearing an odd number of times on its neighborhood. This concept was…