Browse "Dept. of Mathematical Sciences(수리과학과)" by Subject CLIQUE-WIDTH
Showing results 1 to 13 of 13
| Excluding a Bipartite Circle Graph from Line Graphs Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.60, no.3, pp.183 - 203, 2009-03 |
| Graphs of bounded depth-2 rank-brittleness Kwon, O-joung; Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.96, no.3, pp.361 - 378, 2021-03 |
| Obstructions for bounded shrub-depth and rank-depth Kwon, O-joung; McCarty, Rose; Oum, Sang-il; Wollan, Paul, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.149, pp.76 - 91, 2021-07 |
| Rank-width and tree-width of H-minor-free graphs Fomin, FV; Oum, Sang-il; Thilikos, DM, EUROPEAN JOURNAL OF COMBINATORICS, v.31, no.7, pp.1617 - 1628, 2010-10 |
| Rank-width and vertex-minors Oum, Sang-il, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.95, no.1, pp.79 - 100, 2005-09 |
| Rank-width and well-quasi-ordering Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.22, no.2, pp.666 - 682, 2008 |
| Rank-width is less than or equal to branch-width Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.57, no.3, pp.239 - 244, 2008-03 |
| Rank-width of random graphs Lee, Choongbum; Lee, Joonkyung; Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.70, no.3, pp.339 - 347, 2012-07 |
| Rank-width: algorithmic and structural results Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.231, pp.15 - 24, 2017-11 |
| The "Art of Trellis Decoding" Is Fixed-Parameter Tractable Jeong, Jisu; Kim, Eun Jung; Oum, Sang-il, IEEE TRANSACTIONS ON INFORMATION THEORY, v.63, no.11, pp.7178 - 7205, 2017-11 |
The average cut-rank of graphs Nguyen, Huy-Tung; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.90, 2020-12 |
| Vertex-minors of graphs: A survey Kim, Donggyu; Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.351, pp.54 - 73, 2024-07 |
| Vertex-minors, monadic second-order logic, and a conjecture by Seese Courcelle, B; Oum, Sang-il, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.97, no.1, pp.91 - 126, 2007-01 |
Discover
Type
- 2,106 Article
- 503 Conference
- 7 Patent
- 670 Thesis(Master)
- 347 Thesis(Ph.D)