10 citations · 16 across the 5 of their papers we have counts for
8 papers
Every cubic graph has four total dominating sets covering each vertex at most twice
Hyemin Kwon, Boram Park, Yoshio Sano
In 2018, Goddard and Henning conjectured that every cubic graph has four total dominating sets covering each vertex at most twice, and asked the analogous question for transversals…
Det-extremal cubic graphs and the total domatic number
Myungho Choi, Hyemin Kwon, Boram Park
A graph is det-extremal if for its adjacency matrix . Det-extremal cubic bipartite graphs arise in the study of Pólya's permane…
The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs
James Anderson, Herman Chau, Eun-Kyung Cho +6
We introduce a new tool useful for greedy coloring, which we call the forb-flex method, and apply it to odd coloring and proper conflict-free coloring of planar graphs. The odd chr…
Strong odd coloring of sparse graphs
Hyemin Kwon, Boram Park
An odd coloring of a graph is a proper coloring of such that for every non-isolated vertex , there is a color appearing an odd number of times in . Odd coloring…
Brooks-type theorems for relaxations of square colorings
Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon +1
The following relaxation of proper coloring the square of a graph was recently introduced: for a positive integer , the proper -conflict-free chromatic number of a graph ,…
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…
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…
Tight bound for independent domination of cubic graphs without -cycles
Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon +1
Given a graph , a dominating set of is a set of vertices such that each vertex not in has a neighbor in . The domination number of , denoted , is the min…