default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJung Yeun Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j14]Jihoon Choi, Soogang Eoh, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
The partial order competition dimensions of bipartite graphs. Discret. Appl. Math. 254: 47-55 (2019)- 2017
- [j13]Jihoon Choi, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
On the partial order competition dimensions of chordal graphs. Discret. Appl. Math. 222: 89-96 (2017) - 2016
- [j12]Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
The competition graphs of oriented complete bipartite graphs. Discret. Appl. Math. 201: 182-190 (2016) - [j11]Jihoon Choi, Kyeong Seok Kim, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
On the competition graphs of d-partial orders. Discret. Appl. Math. 204: 29-37 (2016) - 2015
- [j10]Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
A generalization of Opsut's result on the competition numbers of line graphs. Discret. Appl. Math. 181: 152-159 (2015) - 2014
- [j9]Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
The competition hypergraphs of doubly partial orders. Discret. Appl. Math. 165: 185-191 (2014) - 2013
- [c1]Tae Hwan Kim, Jung Yeun Lee, Joon Heo, Sang Heum Cho:
Graph contraction based self-organizing networks for future Internet. IM 2013: 1116-1121 - 2012
- [j8]Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
The competition number of a graph and the dimension of its hole space. Appl. Math. Lett. 25(3): 638-642 (2012) - [j7]Seog-Jin Kim, Suh-Ryung Kim, Jung Yeun Lee, Won-Jin Park, Yoshio Sano:
Graph Equation for Line Graphs and m-Step Graphs. Graphs Comb. 28(6): 831-842 (2012) - 2011
- [j6]Boram Park, Jung Yeun Lee, Suh-Ryung Kim:
The m-step competition graphs of doubly partial orders. Appl. Math. Lett. 24(6): 811-816 (2011) - [j5]Jung Yeun Lee, Suh-Ryung Kim, Seog-Jin Kim, Yoshio Sano:
Graphs having many holes but with small competition numbers. Appl. Math. Lett. 24(8): 1331-1335 (2011) - 2010
- [j4]Jung Yeun Lee, Suh-Ryung Kim, Seog-Jin Kim, Yoshio Sano:
The competition number of a graph with exactly two holes. Ars Comb. 95 (2010) - [j3]Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
The competition number of a graph whose holes do not overlap much. Discret. Appl. Math. 158(13): 1456-1460 (2010)
2000 – 2009
- 2009
- [j2]Jung Yeun Lee, Suh-Ryung Kim:
Competition Graphs of Acyclic Digraphs Satisfying Condition C*(p). Ars Comb. 93 (2009) - 2006
- [j1]Han Hyuk Cho, Suh-Ryung Kim, Jung Yeun Lee:
On the graph inequality thetaE(G) geq thetaE(Gm). Discret. Math. 306(8-9): 738-744 (2006)
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-04-24 23:08 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:
