Showing results 1 to 8 of 8
Constructive algorithm for path-width and branch-width of matroids and rank-width of graphs Jeong, Ji Su; Kim, Eun Jung; Oum, Sang Il, International Workshop on Graph Decomposition , Centre International De Rencontres Mathematiques, 2015-01-19 |
Constructive algorithm for path-width of matroids Jeong, Ji Su; Kim, Eun Jung; Oum, Sang Il, GROW 2015 :the 7th workshop on Graph Classes, Optimization, and Width Parameters, Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, 2015-10-13 |
Constructive algorithm for path-width of matroids Jeong, Ji Su; Kim, Eun Jung; Oum, Sang Il, 2015 International Workshop on Mathematical Sciences in Dalian, Dalian University of Technology, 2015-11-01 |
Constructive algorithm for rank-width of graphs and path-width/branch-width of matroids Jeong, Ji Su; Kim, Eun Jung; Oum, Sang Il, Algorithmic Graph Theory on the Adriatic Coast (16-19 June 2015), University of Primorska, 2015-06-17 |
Counting cliques in graphs with forbidden subdivision Lee, Choong Bum; Oum, Sang Il, The 8th International Congress on Industrial and Applied Mathematics (ICIAM 2015), ICIAM 2015 organizing committee, 2015-08-10 |
Improper coloring and the odd Hadwiger’s conjecture Kang, Dong Yeap; Oum, Sang Il, Graph Theory in the Andes, University of Chile, 2015-12-07 |
Partitioning H-minor-free graphs into three subgraphs with no large components Liu, Chun Hung; Oum, Sang Il, 7th KIAS Combinatorics Workshop, KIAS, 2015-03-13 |
Strongly even-cycle decomposable graphs Huynh, Tony; King, Andrew; Oum, Sang Il; Verdian-Rizi, Maryam, 2015 Combinatorics Workshop, NIMS, 2015-07-13 |
Discover