Ringi Kim

According to our database1, Ringi Kim authored at least 12 papers between 2016 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Classes of graphs with no long cycle as a vertex-minor are polynomially <i>χ</i>-bounded.
J. Comb. Theory, Ser. B, 2020

A Ramsey-type theorem for the matching number regarding connected graphs.
Discret. Math., 2020

2019
Largest 2-Regular Subgraphs in 3-Regular Graphs.
Graphs Comb., 2019

Characterization of forbidden subgraphs for bounded star chromatic number.
Discret. Math., 2019

2018
Cycles with two blocks in k-chromatic digraphs.
J. Graph Theory, 2018

Domination in tournaments.
J. Comb. Theory, Ser. B, 2018

Chromatic index determined by fractional chromatic index.
J. Comb. Theory, Ser. B, 2018

Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded.
CoRR, 2018

2017
Unavoidable Subtournaments in Large Tournaments with No Homogeneous Sets.
SIAM J. Discret. Math., 2017

Tree-Chromatic Number Is Not Equal to Path-Chromatic Number<sup>*</sup>.
J. Graph Theory, 2017

2016
Unavoidable induced subgraphs in large graphs with no homogeneous sets.
J. Comb. Theory, Ser. B, 2016

Disjoint dijoins.
J. Comb. Theory, Ser. B, 2016


  Loading...