Seonghyuk Im

According to our database, Seonghyuk Im authored at least 7 papers between 2016 and 2025.

Collaborative distances:

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

2025

An efficient algorithm for ℱ-subgraph-free Edge Deletion on graphs having a product structure.

Shinwoo An, Seonghyuk Im, Seokbeom Kim, Myounghwan Lee

CoRR, October, 2025

Dirac's Theorem for Linear Hypergraphs.

Seonghyuk Im, Hyunwoo Lee

SIAM J. Discret. Math., 2025

On Rainbow Turán Densities of Trees.

Seonghyuk Im, Jaehoon Kim, Hyunwoo Lee, Haesong Seo

Random Struct. Algorithms, 2025

Crux, space constraints and subdivisions.

Seonghyuk Im, Jaehoon Kim, Younjin Kim, Hong Liu

J. Comb. Theory B, 2025

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

Discret. Appl. Math., 2025

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