Sang-il Oum

activity

20092026

most citedRank-width: Algorithmic and structural results

47 citations · 678 across the 85 of their papers we have counts for

collaborators

Showing 2015 · math.COShow all

3 papers · 2 filters

math.CO2015★ 5 cited

Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors

Ilkyoo Choi, O-joung Kwon, Sang-il Oum

A fan $F_{k}$ is a graph that consists of an induced path on $k$ vertices and an additional vertex that is adjacent to all vertices of the path. We prove that for all positive intege…

math.CO2015★ 11 cited

Unavoidable induced subgraphs in large graphs with no homogeneous sets

Maria Chudnovsky, Ringi Kim, Sang-il Oum +1

A homogeneous set of an $n$ -vertex graph is a set $X$ of vertices ( $2 \leq ∣ X ∣ \leq n - 1$ ) such that every vertex not in $X$ is either complete or anticomplete to $X$ . A graph is called…

math.CO2015★ 17 cited

Partitioning $H$ -minor free graphs into three subgraphs with no large components

Chun-Hung Liu, Sang-il Oum

We prove that for every graph $H$ , if a graph $G$ has no (odd) $H$ minor, then its vertex set $V (G)$ can be partitioned into three sets $X_{1}$ , $X_{2}$ , $X_{3}$ such that for each~ $i$ ,…

Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors

Unavoidable induced subgraphs in large graphs with no homogeneous sets

Partitioning H-minor free graphs into three subgraphs with no large components

Partitioning $H$ -minor free graphs into three subgraphs with no large components