Spanning Caterpillars Having at Most k Leaves. - Mikio Kano; Tomoki Yamashita; Zheng Yan 006 (TJJCCGG, 2012)

Spanning trees whose stems have at most k leaves. - Mikio Kano; Zheng Yan 006 (Ars Comb., 2014)

Star-cycle factors of graphs. - Yoshimi Egawa; Mikio Kano; Zheng Yan 006 (Discuss. Math. Graph Theory, 2014)

Spanning Trees Whose Stems are Spiders. - Mikio Kano; Zheng Yan 006 (Graphs Comb., 2015)

Spanning trees with bounded degrees and leaves. - Mikio Kano; Zheng Yan 006 (Discret. Math., 2016)

(1, f)-Factors of Graphs with Odd Property. - Yoshimi Egawa; Mikio Kano; Zheng Yan 006 (Graphs Comb., 2016)

Embedded connectivity of recursive networks. - Xiang-Jun Li; Qi-Qi Dong; Zheng Yan 006; Jun-Ming Xu 001 (Theor. Comput. Sci., 2016)

Independence Number and k-Trees of Graphs. - Zheng Yan 006 (Graphs Comb., 2017)

On fault tolerance of (n, k)-star networks. - Xiang-Jun Li; Yong-Ni Guan; Zheng Yan 006; Jun-Ming Xu 001 (Theor. Comput. Sci., 2017)

On 3-stable number conditions in n-connected claw-free graphs. - Zheng Yan 006; Masao Tsugaki (Discret. Math., 2018)

On conditional fault tolerance of hierarchical cubic networks. - Xiang-Jun Li; Min Liu; Zheng Yan 006; Jun-Ming Xu 001 (Theor. Comput. Sci., 2019)

Strong Tutte type conditions and factors of graphs. - Mikio Kano; Zheng Yan 006 (Discuss. Math. Graph Theory, 2020)