default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRunrun Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j21]Chenran Pan
, Weifan Wang, Runrun Liu:
IC-planar graphs are odd-10-colorable. Appl. Math. Comput. 451: 128020 (2023)- [j20]Xiaofeng Gu, Runrun Liu, Gexin Yu:
Spanning tree packing and 2-essential edge-connectivity. Discret. Math. 346(1): 113132 (2023) - [j19]Runrun Liu, Martin Rolek, Gexin Yu:
Optimal connectivity for fat-triangle linkages. Discret. Math. 346(5): 113319 (2023) - [j18]Runrun Liu, Weifan Wang, Gexin Yu:
1-planar graphs are odd 13-colorable. Discret. Math. 346(8): 113423 (2023) - 2022
- [j17]Runrun Liu, Weifan Wang:
A sufficient condition for a planar graph to be (F, F2)-partitionable. Discret. Appl. Math. 318: 61-68 (2022) - 2021
- [j16]Xiangwen Li, Runrun Liu, Gexin Yu:
Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable. Discret. Appl. Math. 304: 236-247 (2021) - [j15]Runrun Liu, Martin Rolek, D. Christopher Stephens, Dong Ye, Gexin Yu:
Connectivity for Kite-Linked Graphs. SIAM J. Discret. Math. 35(1): 431-446 (2021) - 2020
- [j14]Runrun Liu, Xiangwen Li, Kittikorn Nakprasit, Pongpat Sittitrai, Gexin Yu:
DP-4-colorability of planar graphs without adjacent cycles of given length. Discret. Appl. Math. 277: 245-251 (2020) - [j13]Runrun Liu, Xujun Liu, Martin Rolek, Gexin Yu:
Packing (1, 1, 2, 2)-coloring of some subcubic graphs. Discret. Appl. Math. 283: 626-630 (2020) - [j12]Runrun Liu, Gexin Yu:
Planar graphs without short even cycles are near-bipartite. Discret. Appl. Math. 284: 626-630 (2020) - [j11]Seog-Jin Kim, Runrun Liu, Gexin Yu:
Planar graphs without 7-cycles and butterflies are DP-4-colorable. Discret. Math. 343(8): 111714 (2020)
2010 – 2019
- 2019
- [j10]Ziwen Huang, Runrun Liu, Gaozhen Wang:
Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph. Discret. Appl. Math. 268: 112-118 (2019) - [j9]Runrun Liu, Sarah Loeb, Yuxue Yin, Gexin Yu:
DP-3-coloring of some planar graphs. Discret. Math. 342(1): 178-189 (2019) - [j8]Runrun Liu, Xiangwen Li:
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable. Discret. Math. 342(3): 623-627 (2019) - [j7]Lily Chen, Runrun Liu, Gexin Yu, Ren Zhao, Xiangqian Zhou:
DP-4-colorability of two classes of planar graphs. Discret. Math. 342(11): 2984-2993 (2019) - [j6]Runrun Liu, Martin Rolek, Gexin Yu:
Minimum degree condition for a graph to be knitted. Discret. Math. 342(11): 3225-3228 (2019) - [j5]Runrun Liu, Xiangwen Li:
Every planar graph without adjacent cycles of length at most 8 is 3-choosable. Eur. J. Comb. 82 (2019) - [j4]Runrun Liu, Sarah Loeb, Martin Rolek, Yuxue Yin, Gexin Yu:
DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6, 7, 8}. Graphs Comb. 35(3): 695-705 (2019) - 2018
- [j3]Heather Hoskins, Runrun Liu, Jennifer Vandenbussche, Gexin Yu:
Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable. J. Comb. Optim. 36(2): 346-364 (2018) - 2016
- [j2]Runrun Liu, Xiangwen Li, Gexin Yu:
Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable. Discret. Math. 339(2): 992-1003 (2016) - 2015
- [j1]Runrun Liu, Xiangwen Li, Gexin Yu:
A relaxation of the Bordeaux Conjecture. Eur. J. Comb. 49: 240-249 (2015)
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:10 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:
