Jungho Ahn

activity

20192026

most citedBounds for the Twin-width of Graphs

15 citations · 28 across the 8 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.CC2022★ 5 cited

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

A proper coloring of a graph is \emph{proper conflict-free} if every non-isolated vertex $v$ has a neighbor whose color is unique in the neighborhood of $v$ . A proper coloring of a…

cs.DS2022

Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes

Jungho Ahn, Jinha Kim, O-joung Kwon

Let $F$ be a family of graphs, and let $p, r$ be nonnegative integers. The \textsc{ $(p, r, F)$ -Covering} problem asks whether for a graph $G$ and an integer $k$ , t…

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

Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes

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