Seonghyuk Im

According to our database, Seonghyuk Im authored at least 3 papers between 2016 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs.

Jungho Ahn, Seonghyuk Im, Sang-il Oum

CoRR, 2022

2018

Complexity of Partitioning Hypergraphs.

Seonghyuk Im

CoRR, 2018

2016

On the mean square displacement of a random walk on a graph.

Seonghyuk Im, Hwidong Kim, Jiho Maeng, Jihwan Yu, Yongwook Cha, Seong-Hun Paeng

Eur. J. Comb., 2016