Completely independent spanning trees in k-th power of graphs. - Xia Hong 005 (Discuss. Math. Graph Theory, 2018)

A Hamilton sufficient condition for completely independent spanning tree. - Xia Hong 005; Huihui Zhang (Discret. Appl. Math., 2020)

The signed Roman domination number of two classes graphs. - Xia Hong 005; Tianhu Yu; Zhengbang Zha; Huihui Zhang (Discret. Math. Algorithms Appl., 2020)

Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph. - Xia Hong 005; Feng Gao; Zengbao Wu (Contributions Discret. Math., 2024)

Coloring of (P6,dart, K4)-free graphs. - Xia Hong 005; Baogang Xu (Discret. Appl. Math., 2025)

Completely independent spanning trees in kth power of 2-connected graphs. - Xia Hong 005; Zhizheng Zhang 013 (Discret. Appl. Math., 2025)