A lower bound on the number of removable ears of 1-extendable graphs. - Shaohui Zhai; Claudio L. Lucchesi; Xiaofeng Guo (Discret. Math., 2010)

Removable ears of 1-extendable graphs. - Shaohui Zhai; Xiaofeng Guo (J. Syst. Sci. Complex., 2010)

The optimal strong radius and optimal strong diameter of the Cartesian product graphs. - Meirun Chen; Xiaofeng Guo; Shaohui Zhai (Appl. Math. Lett., 2011)

Total chromatic number of folded hypercubes. - Meirun Chen; Xiaofeng Guo; Shaohui Zhai (Ars Comb., 2013)

Total and adjacent vertex-distinguishing total chromatic numbers of augmented cubes. - Meirun Chen; Shaohui Zhai (Ars Comb., 2014)

Extending matchings in planar odd graphs. - Shaohui Zhai; Xiaofeng Guo (Ars Comb., 2015)

Clar structures vs Fries structures in hexagonal systems. - Shaohui Zhai; Dalal Awadh Alrowaili; Dong Ye 002 (Appl. Math. Comput., 2018)

Homeomorphically irreducible spanning trees in hexangulations of surfaces. - Shaohui Zhai; Erling Wei; Jinghua He; Dong Ye 002 (Discret. Math., 2019)

On perfect matchings in matching covered graphs. - Jinghua He; Erling Wei; Dong Ye 002; Shaohui Zhai (J. Graph Theory, 2019)

Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks. - Litao Guo; Mingzu Zhang; Shaohui Zhai; Liqiong Xu (Int. J. Found. Comput. Sci., 2021)