Heterochromatic tree partition numbers for complete bipartite graphs. - He Chen 002; Zemin Jin; Xueliang Li 001; Jianhua Tu (Discret. Math., 2008)

NP-completeness of 4-incidence colorability of semi-cubic graphs. - Xueliang Li 001; Jianhua Tu (Discret. Math., 2008)

Complete solution for the rainbow numbers of matchings. - He Chen 002; Xueliang Li 001; Jianhua Tu (Discret. Math., 2009)

Bipartite rainbow numbers of matchings. - Xueliang Li 001; Jianhua Tu; Zemin Jin (Discret. Math., 2009)

A factor 2 approximation algorithm for the vertex cover P3 problem. - Jianhua Tu; Wenli Zhou (Inf. Process. Lett., 2011)

A primal-dual approximation algorithm for the vertex cover P3 problem. - Jianhua Tu; Wenli Zhou (Theor. Comput. Sci., 2011)

The vertex cover P3P3 problem in cubic graphs. - Jianhua Tu; Fengmei Yang (Inf. Process. Lett., 2013)

Rainbow numbers for matchings in plane triangulations. - Stanislav Jendrol'; Ingo Schiermeyer; Jianhua Tu (Discret. Math., 2014)

A 2-approximation algorithm for the vertex cover P4 problem in cubic graphs. - Yuchao Li; Jianhua Tu (Int. J. Comput. Math., 2014)

Graphs with fixed number of pendent vertices and minimal Zeroth-order general Randić index. - Guifu Su; Jianhua Tu; Kinkar Chandra Das (Appl. Math. Comput., 2015)

The unicyclic graphs with maximum degree resistance distance. - Jianhua Tu; Junfeng Du; Guifu Su (Appl. Math. Comput., 2015)

Inertia of complex unit gain graphs. - Guihai Yu; Hui Qu; Jianhua Tu (Appl. Math. Comput., 2015)

On the number of 5-matchings in boron-nitrogen fullerene graphs. - Yuchao Li; Junfeng Du; Jianhua Tu (Ars Comb., 2015)

The degree resistance distance of cacti. - Junfeng Du; Guifu Su; Jianhua Tu; Ivan Gutman (Discret. Appl. Math., 2015)

A fixed-parameter algorithm for the vertex cover P3 problem. - Jianhua Tu (Inf. Process. Lett., 2015)

The generalized 3-connectivity of star graphs and bubble-sort graphs. - Shasha Li; Jianhua Tu; Chenyan Yu (Appl. Math. Comput., 2016)

An improved algorithm for the vertex cover P3 problem on graphs of bounded treewidth. - Zongwen Bai; Jianhua Tu; Yongtang Shi (CoRR, 2016)

An FPT algorithm for the vertex cover P4 problem. - Jianhua Tu; Zemin Jin (Discret. Appl. Math., 2016)

Efficient algorithm for the vertex cover Pk problem on cacti. - Jianhua Tu (Appl. Math. Comput., 2017)

A kind of conditional connectivity of Cayley graphs generated by wheel graphs. - Jianhua Tu; Yukang Zhou; Guifu Su (Appl. Math. Comput., 2017)

The Generalized 3-Connectivity of Cayley Graphs on Symmetric Groups Generated by Trees and Cycles. - Shasha Li; Yongtang Shi; Jianhua Tu (Graphs Comb., 2017)

On the vertex cover P3 problem parameterized by treewidth. - Jianhua Tu; Lidong Wu; Jing Yuan 002; Lei Cui 010 (J. Comb. Optim., 2017)

Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index. - Junqi Fei; Jianhua Tu (Appl. Math. Comput., 2018)

Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth. - Pengfei Wan; Jianhua Tu; Shenggui Zhang; Binlong Li (Appl. Math. Comput., 2018)

Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number. - Zemin Jin; Yuefang Sun; Jianhua Tu (Discuss. Math. Graph Theory, 2018)

Design and Implementation of Rapid Detection Platform for Fault of Communication Gateway. - Xianglin Tan; Zhichao Shao; Fuqi Qu; Jianhua Tu; Yi'an Wang; Dianchao Zhou (AIAM (IEEE), 2019)

The Turán number of star forests. - Yongxin Lan; Tao Li 022; Yongtang Shi; Jianhua Tu (Appl. Math. Comput., 2019)

Graph entropy based on the number of spanning forests of c-cyclic graphs. - Pengfei Wan; Jianhua Tu; Matthias Dehmer; Shenggui Zhang; Frank Emmert-Streib (Appl. Math. Comput., 2019)

A multi-start iterated greedy algorithm for the minimum weight vertex cover P3 problem. - Wenjie Zhang; Jianhua Tu; Lidong Wu (Appl. Math. Comput., 2019)

On the complexity of k-rainbow cycle colouring problems. - Shasha Li; Yongtang Shi; Jianhua Tu; Yan Zhao 013 (Discret. Appl. Math., 2019)

An efficient polynomial time approximation scheme for the vertex cover P 3 problem on planar graphs. - Yongtang Shi; Jianhua Tu (Discuss. Math. Graph Theory, 2019)

An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth. - Zongwen Bai; Jianhua Tu; Yongtang Shi (Discret. Math. Theor. Comput. Sci., 2019)

On graph entropy measures based on the number of independent sets and matchings. - Pengfei Wan; Xinzhuang Chen; Jianhua Tu; Matthias Dehmer; Shenggui Zhang; Frank Emmert-Streib (Inf. Sci., 2020)

On Tree-Connectivity and Path-Connectivity of Graphs. - Shasha Li; Zhongmei Qin; Jianhua Tu; Jun Yue (Graphs Comb., 2021)

The maximum number of maximum dissociation sets in trees. - Jianhua Tu; Zhipeng Zhang; Yongtang Shi (J. Graph Theory, 2021)

Maximal and maximum dissociation sets in general and triangle-free graphs. - Jianhua Tu; Yuxin Li; Junfeng Du (Appl. Math. Comput., 2022)

A Survey on the k-Path Vertex Cover Problem. - Jianhua Tu (Axioms, 2022)

Entropy, Graph Homomorphisms, and Dissociation Sets. - Ziyuan Wang; Jianhua Tu; Rongling Lang (Entropy, 2023)

Maximizing the number of independent sets in claw-free cubic graphs. - Junyi Xiao; Jianhua Tu (Appl. Math. Comput., 2023)

Edge-Diameter of a Graph and Its Longest Cycles. - Lei Zhang; Liming Xiong; Jianhua Tu (Graphs Comb., 2023)

Maximum dissociation sets in subcubic trees. - Lei Zhang; Jianhua Tu; Chunlin Xin (J. Comb. Optim., 2023)

Enumerating maximal dissociation sets in three classes of grid graphs. - Yuting Tian; Jianhua Tu (Appl. Math. Comput., 2024)

On the maximum number of maximum dissociation sets in trees with given dissociation number. - Jianhua Tu; Lei Zhang; Junfeng Du (Discret. Math., 2024)

Bounds on the maximum modulus of dissociation roots. - Guo Chen; Hongzhi Deng; Jianhua Tu; Wenke Zhou (Discret. Appl. Math., 2025)

The minimum number of maximal independent sets in graphs with given order and independence number. - Yuting Tian; Jianhua Tu (Discret. Appl. Math., 2025)

Upper bound for the number of maximal dissociation sets in trees. - Ziyuan Wang; Lei Zhang; Jianhua Tu; Liming Xiong (Discret. Math., 2025)