Connectivity of Cartesian product graphs. - Jun-Ming Xu 001; Chao Yang 003 (Discret. Math., 2006)

Feedback numbers of Kautz digraphs. - Jun-Ming Xu 001; Yezhou Wu; Jia Huang; Chao Yang 003 (Discret. Math., 2007)

Fault diameter of product graphs. - Jun-Ming Xu 001; Chao Yang 003 (Inf. Process. Lett., 2007)

Reliability of interconnection networks modeled by Cartesian product digraphs. - Chao Yang 003; Jun-Ming Xu 001 (Networks, 2008)

Forwarding index of cube-connected cycles. - Jun Yan; Jun-Ming Xu 001; Chao Yang 003 (Discret. Appl. Math., 2009)

Diameter vulnerability of graphs by edge deletion. - He-Xi Ye; Chao Yang 003; Jun-Ming Xu 001 (Discret. Math., 2009)

Connectivity and super-connectivity of Cartesian product graphs. - Jun-Ming Xu 001; Chao Yang 003 (Ars Comb., 2010)

Sliding puzzles and rotating puzzles on graphs. - Chao Yang 003 (Discret. Math., 2011)

Connectivity of lexicographic product and direct product of graphs. - Chao Yang 003; Jun-Ming Xu 001 (Ars Comb., 2013)

Snowman is PSPACE-complete. - Weihua He; Ziwen Liu; Chao Yang 003 (Theor. Comput. Sci., 2017)

On the Complexity of Jelly-no-Puzzle. - Chao Yang 003 (JCDCGGG, 2018)

Unified extremal results of topological indices and spectral invariants of graphs. - Yuedan Yao; Muhuo Liu; Francesco Belardo; Chao Yang 003 (Discret. Appl. Math., 2019)

Hanano Puzzle is NP-hard. - Ziwen Liu; Chao Yang 003 (Inf. Process. Lett., 2019)

On the Computational Complexity of Pushing Machine. - Chao Yang 003 (JCDCGGG, 2022)

The Spectral Distribution of Random Mixed Graphs. - Yue Guan; Bo Cheng 015; Minfeng Chen; Meili Liang; Jianxi Liu; Jinxun Wang; Chao Yang 003; Li Zeng (Axioms, 2022)

Tiling the Plane with a Set of Ten Polyominoes. - Chao Yang 003 (Int. J. Comput. Geom. Appl., 2023)

Friends-and-strangers is PSPACE-complete. - Chao Yang 003; Zhujun Zhang (Inf. Process. Lett., 2025)