20 citations · 180 across the 43 of their papers we have counts for
5 papers · 1 filter
Classes of graphs with no long cycle as a vertex-minor are polynomially -bounded
Ringi Kim, O-joung Kwon, Sang-il Oum +1
A class of graphs is -bounded if there is a function such that for every graph and every induced subgraph of , . In ad…
A Menger-like property of tree-cut width
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond +1
In 1990, Thomas proved that every graph admits a tree decomposition of minimum width that additionally satisfies a certain vertex-connectivity condition called leanness [A Menger-l…
Packing and covering induced subdivisions
O-joung Kwon, Jean-Florent Raymond
A class of graphs has the induced Erdős-Pósa property if there exists a function such that for every graph and every positive integer , contains either…
Generalized distance domination problems and their complexity on graphs of bounded mim-width
Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme +1
We generalize the family of -problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as dista…
Scattered classes of graphs
O-joung Kwon, Sang-il Oum
For a class of graphs equipped with functions defined on subsets of or , we say that is -scattered with respect to if the…