A sharp lower bound of index of the cacti with perfect matchings. - Ziwen Huang; Hanyuan Deng; Shubo Chen (Ars Comb., 2012)

Z3-Connectivity of Claw-Free Graphs. - Ziwen Huang; Xiangwen Li; Jianqing Ma (Graphs Comb., 2017)

A relaxation of the strong Bordeaux Conjecture. - Ziwen Huang; Xiangwen Li; Gexin Yu (J. Graph Theory, 2018)

Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph. - Ziwen Huang; Runrun Liu; Gaozhen Wang (Discret. Appl. Math., 2019)

Every planar graph without triangles adjacent to cycles of length 3 or 6 is (1, 1, 1)-colorable. - Ziwen Huang (Discret. Math., 2020)

Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree. - Junfeng Du; Ziwen Huang; Liming Xiong (Axioms, 2022)

Upper bound for DP-chromatic number of a graph. - Jian-Bo Lv; Jianxi Li; Ziwen Huang (Discret. Appl. Math., 2022)

A relaxation of Novosibirsk 3-color conjecture. - Ziwen Huang (Discret. Math., 2022)

Partitioning Planar Graphs without 4-Cycles and 6-Cycles into a Linear Forest and a Forest. - Xiaojie Huang; Ziwen Huang; Jian-Bo Lv (Graphs Comb., 2023)

Completely Positive Map for Noisy Driven Quantum Systems Derived by Keldysh Expansion. - Ziwen Huang; Yunwei Lu; Anna Grassellino; Alexander Romanenko; Jens Koch; Shaojiang Zhu (Quantum, 2023)

Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph. - Ziwen Huang; Fan Yang; Xiaoxia Zhang (J. Appl. Math. Comput., 2024)

An (F2,F6)-partition of planar graphs without cycles of length 4 and 6. - Ziwen Huang; Xiangwen Li; Lin Niu (Discret. Math., 2025)

Reinforcement-Learning-Based Layer-Wise Aggregation for Personalized Federated Learning. - Ziwen Huang; Nikolaos M. Freris (IEEE Internet Things J., 2025)