5 citations · 7 across the 7 of their papers we have counts for
4 papers · 1 filter
Characterization of forbidden subgraphs for bounded star chromatic number
Ilkyoo Choi, Ringi Kim, Boram Park
The chromatic number of a graph is the minimum such that the graph has a proper -coloring. There are many coloring parameters in the literature that are proper colorings tha…
Classes of graphs with no long cycle as a vertex-minor are polynomially -bounded
Ringi Kim, O-joung Kwon, Sang-il Oum +1
A class of graphs is -bounded if there is a function such that for every graph and every induced subgraph of , . In ad…
A Ramsey-type theorem for the matching number regarding connected graphs
Ilkyoo Choi, Michitaka Furuya, Ringi Kim +1
A major line of research is discovering Ramsey-type theorems, which are results of the following form: given a graph parameter , every graph with sufficiently large c…
Unavoidable Subtournaments in Tournaments with Large Chromatic Number
Ilhee Kim, Ringi Kim
For a set H of tournaments, we say H is heroic if every tournament, not containing any member of H as a subtournament, has bounded chromatic number. Berger et al. explicitly charac…