default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEun-Kyung Cho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j14]Eun-Kyung Cho, Ilkyoo Choi
, Hyemin Kwon, Boram Park:
Brooks-type theorems for relaxations of square colorings. Discret. Math. 348(1): 114233 (2025)- 2024
- [j13]Eun-Kyung Cho, Minki Kim:
Independent domination versus packing in subcubic graphs. Discret. Appl. Math. 357: 132-134 (2024) - [j12]Eun-Kyung Cho, Ilkyoo Choi, Bernard Lidický:
Relaxation of Wegner's planar graph conjecture for maximum degree 4. Discret. Appl. Math. 358: 254-261 (2024) - 2023
- [j11]Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park:
Odd coloring of sparse graphs and planar graphs. Discret. Math. 346(5): 113305 (2023) - [j10]Eun-Kyung Cho, Jinha Kim, Minki Kim, Sang-il Oum:
Independent domination of graphs with bounded maximum degree. J. Comb. Theory B 158(Part): 341-352 (2023) - [j9]Eun-Kyung Cho, Ilkyoo Choi, Boram Park:
On independent domination of regular graphs. J. Graph Theory 103(1): 159-170 (2023) - [j8]Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park:
A tight bound for independent domination of cubic graphs without 4-cycles. J. Graph Theory 104(2): 372-386 (2023) - 2022
- [j7]Eun-Kyung Cho, Ilkyoo Choi, Boram Park:
Improvements on Hippchen's conjecture. Discret. Math. 345(11): 113029 (2022) - [j6]Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park, Tingting Shan, Xuding Zhu:
Decomposing planar graphs into graphs with degree restrictions. J. Graph Theory 101(2): 165-181 (2022) - 2021
- [j5]Eun-Kyung Cho, Ilkyoo Choi, Boram Park:
Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests. Discret. Math. 344(1): 112172 (2021) - [j4]Eun-Kyung Cho, Ilkyoo Choi, Boram Park:
On induced saturation for paths. Eur. J. Comb. 91: 103204 (2021) - [j3]Eun-Kyung Cho, Ilkyoo Choi, Yiting Jiang, Ringi Kim, Boram Park, Jiayan Yan, Xuding Zhu:
Generalized List Colouring of Graphs. Graphs Comb. 37(6): 2121-2127 (2021) - [j2]Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park:
The strong clique index of a graph with forbidden cycles. J. Graph Theory 98(2): 326-341 (2021) - 2019
- [j1]Eun-Kyung Cho, Cunsheng Ding, Jong Yoon Hyun:
A spectral characterisation of t-designs and its applications. Adv. Math. Commun. 13(3): 477-503 (2019)
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-09-22 00:37 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:
