20 citations · 180 across the 43 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.CO2022★ 2 cited
A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
J. Pascal Gollin, Kevin Hendrey, O-joung Kwon +2
In 1965, Erdős and Pósa proved that there is an (approximate) duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such…
cs.DS2022
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
Jungho Ahn, Jinha Kim, O-joung Kwon
Let be a family of graphs, and let be nonnegative integers. The \textsc{-Covering} problem asks whether for a graph and an integer , t…
math.CO2022★ 12 cited
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
Édouard Bonnet, O-joung Kwon, David R. Wood
In a reduction sequence of a graph, vertices are successively identified until the graph has one vertex. At each step, when identifying and , each edge incident to exactly o…