47 citations · 678 across the 85 of their papers we have counts for
5 papers · 1 filter
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
Ilkyoo Choi, O-joung Kwon, Sang-il Oum
A fan is a graph that consists of an induced path on vertices and an additional vertex that is adjacent to all vertices of the path. We prove that for all positive intege…
An FPT 2-Approximation for Tree-Cut Decomposition
Eunjung Kim, Sang-il Oum, Christophe Paul +2
The tree-cut width of a graph is a graph parameter defined by Wollan [J. Comb. Theory, Ser. B, 110:47-66, 2015] with the help of tree-cut decompositions. In certain cases, tree-cut…
The "art of trellis decoding" is fixed-parameter tractable
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Given n subspaces of a finite-dimensional vector space over a fixed finite field , we wish to find a linear layout of the subspaces such that $\dim(…
Unavoidable induced subgraphs in large graphs with no homogeneous sets
Maria Chudnovsky, Ringi Kim, Sang-il Oum +1
A homogeneous set of an -vertex graph is a set of vertices () such that every vertex not in is either complete or anticomplete to . A graph is called…
Partitioning -minor free graphs into three subgraphs with no large components
Chun-Hung Liu, Sang-il Oum
We prove that for every graph , if a graph has no (odd) minor, then its vertex set can be partitioned into three sets , , such that for each~,…