default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZuosong Liang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Junqing Cai
, Huiming Zhai, Zuosong Liang:
Spanning trees with few branch vertices in K1,4-free graphs. Discret. Math. 347(7): 114009 (2024)- [j22]Zuosong Liang:
On the Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree. Graphs Comb. 40(5): 98 (2024) - 2023
- [j21]Zuosong Liang, Guangjun Xu, Chunsong Bai:
A note on the Three Color Problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles. Discret. Math. 346(1): 113192 (2023) - [j20]Zuosong Liang, Juan Wang, Chunsong Bai:
A Generalization of Grötzsch Theorem on the Local-Equitable Coloring. Graphs Comb. 39(1): 4 (2023) - 2022
- [j19]Juan Wang, Zuosong Liang, Jiansheng Cai, Lianying Miao:
Acyclic coloring of claw-free graphs with small degree. Discret. Appl. Math. 321: 272-280 (2022) - [j18]Zuosong Liang:
Total coloring of claw-free planar graphs. Discuss. Math. Graph Theory 42(3): 771-777 (2022) - [j17]Zuosong Liang, Juan Wang, Junqing Cai, Xinxin Yang:
On the complexity of local-equitable coloring of graphs. Theor. Comput. Sci. 906: 76-82 (2022) - 2021
- [j16]Chunsong Bai, Jianjie Zhou, Zuosong Liang:
The Connected P -Median Problem on Cactus Graphs. Comput. Intell. Neurosci. 2021: 3533623:1-3533623:9 (2021) - [j15]Zuosong Liang, Huandi Wei:
A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs. Comput. Intell. Neurosci. 2021: 7667656:1-7667656:5 (2021) - [j14]Zuosong Liang, Yanxia Dong, Yancai Zhao, Huiyu Xing:
Equitable Clique-Coloring in Claw-Free Graphs with Maximum Degree at Most 4. Graphs Comb. 37(2): 445-454 (2021) - 2020
- [j13]Zuosong Liang, Jianliang Wu, Erfang Shan:
List-coloring clique-hypergraphs of K5-minor-free graphs strongly. Discret. Math. 343(4): 111777 (2020) - [j12]Yanxia Dong, Moo Young Sohn, Zuosong Liang:
Domination and matching in power and generalized power hypergraphs. J. Comb. Optim. 39(2): 425-436 (2020)
2010 – 2019
- 2019
- [j11]Zuosong Liang, Erfang Shan, Liying Kang:
The clique-perfectness and clique-coloring of outer-planar graphs. J. Comb. Optim. 38(3): 794-807 (2019) - [j10]Qiannan Wang, Liying Kang, Erfang Shan, Zuosong Liang:
The α-spectral radius of uniform hypergraphs concerning degrees and domination number. J. Comb. Optim. 38(4): 1128-1142 (2019) - [j9]Zuosong Liang, Erfang Shan, Huiyu Xing, Chunsong Bai:
A linear-time algorithm for clique-coloring planar graphs. Oper. Res. Lett. 47(4): 241-243 (2019) - 2017
- [j8]Zuosong Liang, Erfang Shan, Liying Kang:
The clique-transversal set problem in {claw, K4}-free planar graphs. Inf. Process. Lett. 118: 64-68 (2017) - [j7]Zuosong Liang, Erfang Shan, Yuzhong Zhang:
A linear-time algorithm for clique-coloring problem in circular-arc graphs. J. Comb. Optim. 33(1): 147-155 (2017) - 2016
- [j6]Zuosong Liang, Erfang Shan, Liying Kang:
Clique-Coloring Claw-Free Graphs. Graphs Comb. 32(4): 1473-1488 (2016) - [j5]Zuosong Liang, Erfang Shan, Liying Kang:
Clique-Perfectness of Claw-Free Planar Graphs. Graphs Comb. 32(6): 2551-2562 (2016) - 2015
- [j4]Zuosong Liang, Erfang Shan:
The clique-transversal set problem in claw-free graphs with degree at most 4. Inf. Process. Lett. 115(2): 331-335 (2015) - 2014
- [j3]Erfang Shan, Zuosong Liang, Liying Kang:
Clique-transversal sets and clique-coloring in planar graphs. Eur. J. Comb. 36: 367-376 (2014) - 2011
- [j2]Zuosong Liang, Erfang Shan:
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs. Inf. Process. Lett. 111(23-24): 1104-1107 (2011)
2000 – 2009
- 2008
- [j1]Erfang Shan, Zuosong Liang, T. C. Edwin Cheng:
Clique-transversal Number in Cubic Graphs. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - 2007
- [c1]Zuosong Liang, Erfang Shan, T. C. Edwin Cheng:
Clique-Transversal Sets in Cubic Graphs. ESCAPE 2007: 107-115
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-10 02:12 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:
