Hyemin Kwon

activity

20212026

most citedTight bound for independent domination of cubic graphs without

4

-cycles

10 citations · 16 across the 5 of their papers we have counts for

collaborators

Showing 2022Show all

2 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 $c$ -coloring} of a graph is a proper $c$ -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 $c$ -coloring} of a graph is a proper $c$ -coloring such that each non-isolated vertex has a color appearing an odd number of times on its neighborhood. This concept was…