10 citations · 21 across the 16 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
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…
math.CO2022★ 3 cited
Independent domination of graphs with bounded maximum degree
Eun-Kyung Cho, Jinha Kim, Minki Kim +1
An independent dominating set of a graph, also known as a maximal independent set, is a set of pairwise non-adjacent vertices such that every vertex not in is adjacent to s…