Jianhua Tu
Orcid: 0000000276672116
According to our database^{1},
Jianhua Tu
authored at least 43 papers
between 2008 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2024
On the maximum number of maximum dissociation sets in trees with given dissociation number.
Discret. Math., 2024
Appl. Math. Comput., 2024
2023
J. Comb. Optim., August, 2023
Graphs Comb., August, 2023
Appl. Math. Comput., May, 2023
Entropy, January, 2023
2022
Axioms, 2022
Appl. Math. Comput., 2022
2021
J. Graph Theory, 2021
Graphs Comb., 2021
2020
Inf. Sci., 2020
2019
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth.
Discret. Math. Theor. Comput. Sci., 2019
An efficient polynomial time approximation scheme for the vertex cover <i>P<sub> </sub>3</i> problem on planar graphs.
Discuss. Math. Graph Theory, 2019
Discret. Appl. Math., 2019
A multistart iterated greedy algorithm for the minimum weight vertex cover <i>P</i><sub>3</sub> problem.
Appl. Math. Comput., 2019
Appl. Math. Comput., 2019
Appl. Math. Comput., 2019
Design and Implementation of Rapid Detection Platform for Fault of Communication Gateway.
Proceedings of the International Conference on Artificial Intelligence and Advanced Manufacturing, 2019
2018
Rainbow totalcoloring of complementary graphs and ErdösGallai type problem for the rainbow totalconnection number.
Discuss. Math. Graph Theory, 2018
Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth.
Appl. Math. Comput., 2018
Complete characterization of bicyclic graphs with the maximum and secondmaximum degree Kirchhoff index.
Appl. Math. Comput., 2018
2017
J. Comb. Optim., 2017
The Generalized 3Connectivity of Cayley Graphs on Symmetric Groups Generated by Trees and Cycles.
Graphs Comb., 2017
Appl. Math. Comput., 2017
Appl. Math. Comput., 2017
2016
Discret. Appl. Math., 2016
An improved algorithm for the vertex cover P<sub>3</sub> problem on graphs of bounded treewidth.
CoRR, 2016
Appl. Math. Comput., 2016
2015
Inf. Process. Lett., 2015
Discret. Appl. Math., 2015
On the number of 5matchings in boronnitrogen fullerene graphs.
Ars Comb., 2015
Appl. Math. Comput., 2015
Appl. Math. Comput., 2015
Graphs with fixed number of pendent vertices and minimal Zerothorder general Randić index.
Appl. Math. Comput., 2015
2014
A 2approximation algorithm for the vertex cover <i>P</i><sub>4</sub> problem in cubic graphs.
Int. J. Comput. Math., 2014
Discret. Math., 2014
2013
Inf. Process. Lett., 2013
2011
Theor. Comput. Sci., 2011
Inf. Process. Lett., 2011
2009
Discret. Math., 2009
Discret. Math., 2009
2008
Discret. Math., 2008
Discret. Math., 2008