Showing results 1 to 4 of 4
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 |
Dynamic choosability of triangle-free graphs and sparse random graphs Kim, Jaehoon; Ok, Seongmin, JOURNAL OF GRAPH THEORY, v.87, no.3, pp.347 - 355, 2018-03 |
On r-dynamic coloring of graphs Jahanbekam, Sogol; Kim, Jaehoon; Suil, O.; West, Douglas B., DISCRETE APPLIED MATHEMATICS, v.206, pp.65 - 72, 2016-06 |
ORTHOGONAL COLORINGS OF THE SPHERE Holmsen, Andreas; Lee, Seunghun, MATHEMATIKA, v.62, no.2, pp.492 - 501, 2016 |
Discover