default search action
Ringi Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Dohyeon Kim, Ringi Kim, Wonjun Lee, Yuhyeon Lim, Yoojin So:
Balanced Nontransitive Dice: Existence and Probability. Electron. J. Comb. 31(1) (2024) - 2022
- [j19]Ringi Kim, Sergey Norin, Sang-il Oum
:
Obstructions for partitioning into forests and outerplanar graphs. Discret. Appl. Math. 312: 15-28 (2022) - [j18]Ringi Kim
Signed colouring and list colouring of k-chromatic graphs. J. Graph Theory 99(4): 637-650 (2022) - [j17]Eun-Kyung Cho
Decomposing planar graphs into graphs with degree restrictions. J. Graph Theory 101(2): 165-181 (2022) - 2021
- [j16]Ringi Kim
Equitable partition of planar graphs. Discret. Math. 344(6): 112351 (2021) - [j15]Eun-Kyung Cho
Generalized List Colouring of Graphs. Graphs Comb. 37(6): 2121-2127 (2021) - [j14]Ringi Kim, Luke Postle:
The list linear arboricity of graphs. J. Graph Theory 98(1): 125-140 (2021) - [j13]Eun-Kyung Cho
The strong clique index of a graph with forbidden cycles. J. Graph Theory 98(2): 326-341 (2021) - 2020
- [j12]Ilkyoo Choi, Ringi Kim, Boram Park:
Maximum $k$-Sum $\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice. Electron. J. Comb. 27(4): 4 (2020) - [j11]Ilkyoo Choi, Michitaka Furuya, Ringi Kim, Boram Park:
A Ramsey-type theorem for the matching number regarding connected graphs. Discret. Math. 343(2): 111648 (2020) - [j10]Ringi Kim
Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded. J. Comb. Theory, Ser. B 140: 372-386 (2020)
2010 – 2019
- 2019
- [j9]Ilkyoo Choi
Characterization of forbidden subgraphs for bounded star chromatic number. Discret. Math. 342(3): 635-642 (2019) - [j8]Ilkyoo Choi, Ringi Kim, Alexandr V. Kostochka, Boram Park, Douglas B. West:
Largest 2-Regular Subgraphs in 3-Regular Graphs. Graphs Comb. 35(4): 805-813 (2019) - 2018
- [j7]Maria Chudnovsky
Domination in tournaments. J. Comb. Theory B 130: 98-113 (2018) - [j6]Guantao Chen, Yuping Gao, Ringi Kim
Chromatic index determined by fractional chromatic index. J. Comb. Theory B 131: 85-108 (2018) - [j5]Ringi Kim
Cycles with two blocks in k-chromatic digraphs. J. Graph Theory 88(4): 592-605 (2018) - [i1]Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman:
Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded. CoRR abs/1809.04278 (2018) - 2017
- [j4]Tony Huynh
Tree-Chromatic Number Is Not Equal to Path-Chromatic Number*. J. Graph Theory 86(2): 213-222 (2017) - [j3]Ringi Kim
Unavoidable Subtournaments in Large Tournaments with No Homogeneous Sets. SIAM J. Discret. Math. 31(2): 714-725 (2017) - 2016
- [j2]Maria Chudnovsky
Unavoidable induced subgraphs in large graphs with no homogeneous sets. J. Comb. Theory B 118: 1-12 (2016) - [j1]Maria Chudnovsky
Disjoint dijoins. J. Comb. Theory B 120: 18-35 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: