Clique-Transversal Sets in Cubic Graphs. - Zuosong Liang; Erfang Shan; T. C. Edwin Cheng (ESCAPE, 2007)

Clique-transversal Number in Cubic Graphs. - Erfang Shan; Zuosong Liang; T. C. Edwin Cheng (Discret. Math. Theor. Comput. Sci., 2008)

Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs. - Zuosong Liang; Erfang Shan (Inf. Process. Lett., 2011)

Clique-transversal sets and clique-coloring in planar graphs. - Erfang Shan; Zuosong Liang; Liying Kang (Eur. J. Comb., 2014)

The clique-transversal set problem in claw-free graphs with degree at most 4. - Zuosong Liang; Erfang Shan (Inf. Process. Lett., 2015)

Clique-Coloring Claw-Free Graphs. - Zuosong Liang; Erfang Shan; Liying Kang (Graphs Comb., 2016)

Clique-Perfectness of Claw-Free Planar Graphs. - Zuosong Liang; Erfang Shan; Liying Kang (Graphs Comb., 2016)

The clique-transversal set problem in {claw, K4}-free planar graphs. - Zuosong Liang; Erfang Shan; Liying Kang (Inf. Process. Lett., 2017)

A linear-time algorithm for clique-coloring problem in circular-arc graphs. - Zuosong Liang; Erfang Shan; Yuzhong Zhang (J. Comb. Optim., 2017)

The clique-perfectness and clique-coloring of outer-planar graphs. - Zuosong Liang; Erfang Shan; Liying Kang (J. Comb. Optim., 2019)

The α-spectral radius of uniform hypergraphs concerning degrees and domination number. - Qiannan Wang; Liying Kang; Erfang Shan; Zuosong Liang (J. Comb. Optim., 2019)

A linear-time algorithm for clique-coloring planar graphs. - Zuosong Liang; Erfang Shan; Huiyu Xing; Chunsong Bai (Oper. Res. Lett., 2019)

List-coloring clique-hypergraphs of K5-minor-free graphs strongly. - Zuosong Liang; Jianliang Wu 001; Erfang Shan (Discret. Math., 2020)

Domination and matching in power and generalized power hypergraphs. - Yanxia Dong; Moo Young Sohn; Zuosong Liang (J. Comb. Optim., 2020)

The Connected P -Median Problem on Cactus Graphs. - Chunsong Bai; Jianjie Zhou; Zuosong Liang (Comput. Intell. Neurosci., 2021)

A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs. - Zuosong Liang; Huandi Wei (Comput. Intell. Neurosci., 2021)

Equitable Clique-Coloring in Claw-Free Graphs with Maximum Degree at Most 4. - Zuosong Liang; Yanxia Dong; Yancai Zhao; Huiyu Xing (Graphs Comb., 2021)

Acyclic coloring of claw-free graphs with small degree. - Juan Wang; Zuosong Liang; Jiansheng Cai; Lianying Miao (Discret. Appl. Math., 2022)

Total coloring of claw-free planar graphs. - Zuosong Liang (Discuss. Math. Graph Theory, 2022)

On the complexity of local-equitable coloring of graphs. - Zuosong Liang; Juan Wang; Junqing Cai; Xinxin Yang (Theor. Comput. Sci., 2022)

A note on the Three Color Problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles. - Zuosong Liang; Guangjun Xu; Chunsong Bai (Discret. Math., 2023)

A Generalization of Grötzsch Theorem on the Local-Equitable Coloring. - Zuosong Liang; Juan Wang; Chunsong Bai (Graphs Comb., 2023)

Spanning trees with few branch vertices in K1,4-free graphs. - Junqing Cai; Huiming Zhai; Zuosong Liang (Discret. Math., 2024)

On the Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree. - Zuosong Liang (Graphs Comb., 2024)