Search

Start a new search
Current filters:
Add filters:
  • Results/Page
  • Sort items by
  • In order
  • Authors/record

Results 21-30 of 37 (Search time: 0.007 seconds).

NO Title, Author(s) (Publication Title, Volume Issue, Page, Issue Date)
21
CHARACTERIZATION OF CYCLE OBSTRUCTION SETS FOR IMPROPER COLORING PLANAR GRAPHS

Choi, Ilkyoo; Liu, Chun-Hung; Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.32, no.2, pp.1209 - 1228, 2018-06

22
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs

Brignall, Robert; Choi, Hojin; Jeong, Jisu; Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.257, pp.60 - 66, 2019-03

23
Even-cycle decompositions of graphs with no odd-K-4-minor

Huynh, Tony; Oum, Sang-il; Verdian-Rizi, Maryam, EUROPEAN JOURNAL OF COMBINATORICS, v.65, pp.1 - 14, 2017-10

24
Chi-boundedness of graph classes excluding wheel vertex-minors

Choi, Hojin; Kwon, O-joung; Oum, Sang-il; Wollan, Paul, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.135, pp.319 - 348, 2019-03

25
Vertex-minors and the Erdos-Hajnal conjecture

Chudnovsky, Maria; Oum, Sang-il, DISCRETE MATHEMATICS, v.341, no.12, pp.3498 - 3499, 2018-12

26
A Remark on the Paper “Properties of Intersecting Families of Ordered Sets” by O. Einstein

Oum, Sang-il; Wee, Sounggun, COMBINATORICA, v.38, no.5, pp.1279 - 1284, 2018-10

27
Online Ramsey theory for a triangle on F-free graphs

Choi, Hojin; Choi, Ilkyoo; Jeong, Jisu; Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.92, no.2, pp.152 - 171, 2019-10

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

Kim, Ringi; Kwon, O-joung; Oum, Sang-il; Sivaraman, Vaidy, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.140, pp.372 - 386, 2020-01

29
The average cut-rank of graphs

Nguyen, Huy-Tung; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.90, 2020-12

30
Branch-depth: Generalizing tree-depth of graphs

DeVos, Matt; Kwon, O-joung; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.90, 2020-12

rss_1.0 rss_2.0 atom_1.0