10 citations · 21 across the 16 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023
Domination of subcubic planar graphs with large girth
Eun-Kyung Cho, Eric Culver, Stephen G. Hartke +1
Since Reed conjectured in 1996 that the domination number of a connected cubic graph of order is at most , the domination number of cubic graphs has be…
math.CO2023
Independent domination versus packing in subcubic graphs
Eun-Kyung Cho, Minki Kim
In 2011, Henning, Löwenstein, and Rautenbach observed that the domination number of a graph is bounded from above by the product of the packing number and the maximum degree of the…
math.CO2023
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 ,…