Sang-Il Oum, Ph.D.

Affiliations: 
2005 Princeton University, Princeton, NJ 
Google:
"Sang-Il Oum"

Parents

Sign in to add mentor
Paul D. Seymour grad student 2005 Princeton
 (Graphs of bounded rank -width.)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Kwon O, Oum S. (2020) Scattered Classes of Graphs Siam Journal On Discrete Mathematics. 34: 972-999
Kim R, Kwon O, Oum S, et al. (2020) Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded Journal of Combinatorial Theory, Series B. 140: 372-386
DeVos M, Kwon O, Oum S. (2020) Branch-depth: Generalizing tree-depth of graphs European Journal of Combinatorics. 90: 103186
Nguyen H, Oum S. (2020) The average cut-rank of graphs European Journal of Combinatorics. 90: 103183
Kwon O, Oum S. (2020) Graphs of bounded depth‐2 rank‐brittleness Journal of Graph Theory
Kang DY, Oum S. (2019) Improper colouring of graphs with no odd clique minor Combinatorics, Probability & Computing. 28: 740-754
Choi H, Kwon O, Oum S, et al. (2019) Chi-boundedness of graph classes excluding wheel vertex-minors Journal of Combinatorial Theory, Series B. 135: 319-348
Brignall R, Choi H, Jeong J, et al. (2019) Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs Discrete Applied Mathematics. 257: 60-66
Diestel R, Oum S. (2019) Tangle-Tree Duality: In Graphs, Matroids and Beyond Combinatorica. 39: 879-910
Choi H, Choi I, Jeong J, et al. (2019) Online Ramsey theory for a triangle on ‐free graphs Journal of Graph Theory. 92: 152-171
See more...