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 2018Show all

4 papers · 1 filter

math.CO2018★ 9 cited

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 $G$ of graphs is $χ$ -bounded if there is a function $f$ such that for every graph $G \in G$ and every induced subgraph $H$ of $G$ , $χ (H) \leq f (ω (H))$ . In ad…

math.CO2018★ 3 cited

Characterization of cycle obstruction sets for improper coloring planar graphs

Ilkyoo Choi, Chun-Hung Liu, Sang-il Oum

For nonnegative integers $k, d_{1}, \dots, d_{k}$ , a graph is $(d_{1}, \dots, d_{k})$ -colorable if its vertex set can be partitioned into $k$ parts so that the $i$ th part induces a graph…

math.CO2018★ 9 cited

Vertex-minors and the Erdős-Hajnal conjecture

Maria Chudnovsky, Sang-il Oum

We prove that for every graph $H$ , there exists $ε > 0$ such that every $n$ -vertex graph with no vertex-minors isomorphic to $H$ has a pair of disjoint sets $A$ , $B$ of ver…

math.CO2018★ 3 cited

Scattered classes of graphs

O-joung Kwon, Sang-il Oum

For a class $C$ of graphs $G$ equipped with functions $f_{G}$ defined on subsets of $E (G)$ or $V (G)$ , we say that $C$ is $k$ -scattered with respect to $f_{G}$ if the…

Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded

Characterization of cycle obstruction sets for improper coloring planar graphs

Vertex-minors and the Erdős-Hajnal conjecture

Scattered classes of graphs

Classes of graphs with no long cycle as a vertex-minor are polynomially $χ$ -bounded