Hamilton cycles in 3-connected claw-free and net-free graphs. - Wei Xiong 002; Hong-Jian Lai; Xiaoling Ma; Keke Wang; Meng Zhang 005 (Discret. Math., 2013)

Spanning trails in essentially 4-edge-connected graphs. - Jinquan Xu; Zhi-Hong Chen; Hong-Jian Lai; Meng Zhang 005 (Discret. Appl. Math., 2014)

Degree sequence realizations with given packing and covering of spanning trees. - Fengxia Liu; Zhao Zhang 002; Hong-Jian Lai; Meng Zhang 005 (Discret. Appl. Math., 2015)

Spanning trails with variations of Chvátal-Erdős conditions. - Zhi-Hong Chen; Hong-Jian Lai; Meng Zhang 005 (Discret. Math., 2017)

Collapsible subgraphs of a 4-edge-connected graph. - Ran Gu; Hong-Jian Lai; Yanting Liang; Zhengke Miao; Meng Zhang 005 (Discret. Appl. Math., 2019)

Bounding ℓ-edge-connectivity in edge-connectivity. - Xiaoxia Lin; Keke Wang; Meng Zhang 005; Hong-Jian Lai (Discret. Appl. Math., 2022)