Zuosong Liang

24 papers Journal 23Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
On the Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree.
Graphs Comb.
Zuosong Liang
2024 J jnl
Spanning trees with few branch vertices in K1,4-free graphs.
Discret. Math.
Junqing Cai, Huiming Zhai, Zuosong Liang
2023 J jnl
A Generalization of Grötzsch Theorem on the Local-Equitable Coloring.
Graphs Comb.
Zuosong Liang, Juan Wang, Chunsong Bai
2023 J jnl
A note on the Three Color Problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles.
Discret. Math.
Zuosong Liang, Guangjun Xu, Chunsong Bai
2022 J jnl
Acyclic coloring of claw-free graphs with small degree.
Discret. Appl. Math.
Juan Wang, Zuosong Liang, Jiansheng Cai, Lianying Miao
2022 J jnl
On the complexity of local-equitable coloring of graphs.
Theor. Comput. Sci.
Zuosong Liang, Juan Wang, Junqing Cai, Xinxin Yang
2022 J jnl
Total coloring of claw-free planar graphs.
Discuss. Math. Graph Theory
Zuosong Liang
2021 J jnl
A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.
Comput. Intell. Neurosci.
Zuosong Liang, Huandi Wei
2021 J jnl
Equitable Clique-Coloring in Claw-Free Graphs with Maximum Degree at Most 4.
Graphs Comb.
Zuosong Liang, Yanxia Dong, Yancai Zhao, Huiyu Xing
2021 J jnl
The Connected P -Median Problem on Cactus Graphs.
Comput. Intell. Neurosci.
Chunsong Bai, Jianjie Zhou, Zuosong Liang
2020 J jnl
Domination and matching in power and generalized power hypergraphs.
J. Comb. Optim.
Yanxia Dong, Moo Young Sohn, Zuosong Liang
2020 J jnl
List-coloring clique-hypergraphs of K5-minor-free graphs strongly.
Discret. Math.
Zuosong Liang, Jianliang Wu, Erfang Shan
2019 J jnl
A linear-time algorithm for clique-coloring planar graphs.
Oper. Res. Lett.
Zuosong Liang, Erfang Shan, Huiyu Xing, Chunsong Bai
2019 J jnl
The clique-perfectness and clique-coloring of outer-planar graphs.
J. Comb. Optim.
Zuosong Liang, Erfang Shan, Liying Kang
2019 J jnl
The α-spectral radius of uniform hypergraphs concerning degrees and domination number.
J. Comb. Optim.
Qiannan Wang, Liying Kang, Erfang Shan, Zuosong Liang
2017 J jnl
A linear-time algorithm for clique-coloring problem in circular-arc graphs.
J. Comb. Optim.
Zuosong Liang, Erfang Shan, Yuzhong Zhang
2017 J jnl
The clique-transversal set problem in {claw, K
Inf. Process. Lett.
Zuosong Liang, Erfang Shan, Liying Kang
2016 J jnl
Clique-Coloring Claw-Free Graphs.
Graphs Comb.
Zuosong Liang, Erfang Shan, Liying Kang
2016 J jnl
Clique-Perfectness of Claw-Free Planar Graphs.
Graphs Comb.
Zuosong Liang, Erfang Shan, Liying Kang
2015 J jnl
The clique-transversal set problem in claw-free graphs with degree at most 4.
Inf. Process. Lett.
Zuosong Liang, Erfang Shan
2014 J jnl
Clique-transversal sets and clique-coloring in planar graphs.
Eur. J. Comb.
Erfang Shan, Zuosong Liang, Liying Kang
2011 J jnl
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs.
Inf. Process. Lett.
Zuosong Liang, Erfang Shan
2008 J jnl
Clique-transversal Number in Cubic Graphs.
Discret. Math. Theor. Comput. Sci.
Erfang Shan, Zuosong Liang, T. C. Edwin Cheng
2007 — conf
Clique-Transversal Sets in Cubic Graphs.
ESCAPE
Zuosong Liang, Erfang Shan, T. C. Edwin Cheng