5 citations · 6 across the 5 of their papers we have counts for
7 papers
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…
Towards a strengthening of the second neighborhood conjecture
Yandong Bai, Binlong Li, Boram Park
A longstanding conjecture of Seymour, called Seymour's second neighborhood conjecture, states that every oriented graph contains a vertex with $|N^{++}_D(x)|\geq |N^{+}_D(x…
On 2-connected graphs without cycles of length 1 modulo 3
Yandong Bai, Hojin Chu, Binlong Li +2
Burr and Erdős conjectured in 1976 that for all integers such that contains an even integer, every -vertex graph without cycles of length $\ell…
Existence of cycles of length divisible by 3 or 4
Ilkyoo Choi, Hojin Chu, Ringi Kim +1
Dean conjectured that for each integer , every graph with minimum degree at least has a cycle whose length is divisible by ; this conjecture is known to be true for…
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…
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…