Jianhua Tu

48 papers Journal 47Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Maximal independent sets in graphs with a given matching number.
Discret. Math.
Yongtang Shi, Jianhua Tu, Ziyuan Wang
2025 J jnl
Bounds on the maximum modulus of dissociation roots.
Discret. Appl. Math.
Guo Chen, Hongzhi Deng, Jianhua Tu, Wenke Zhou
2025 J jnl
The minimum number of maximal independent sets in graphs with given order and independence number.
Discret. Appl. Math.
Yuting Tian, Jianhua Tu
2025 J jnl
Upper bound for the number of maximal dissociation sets in trees.
Discret. Math.
Ziyuan Wang, Lei Zhang, Jianhua Tu, Liming Xiong
2024 J jnl
Enumerating maximal dissociation sets in three classes of grid graphs.
Appl. Math. Comput.
Yuting Tian, Jianhua Tu
2024 J jnl
On the maximum number of maximum dissociation sets in trees with given dissociation number.
Discret. Math.
Jianhua Tu, Lei Zhang, Junfeng Du
2023 J jnl
Edge-Diameter of a Graph and Its Longest Cycles.
Graphs Comb.
Lei Zhang, Liming Xiong, Jianhua Tu
2023 J jnl
Entropy, Graph Homomorphisms, and Dissociation Sets.
Entropy
Ziyuan Wang, Jianhua Tu, Rongling Lang
2023 J jnl
Maximizing the number of independent sets in claw-free cubic graphs.
Appl. Math. Comput.
Junyi Xiao, Jianhua Tu
2023 J jnl
Maximum dissociation sets in subcubic trees.
J. Comb. Optim.
Lei Zhang, Jianhua Tu, Chunlin Xin
2022 J jnl
A Survey on the k-Path Vertex Cover Problem.
Axioms
Jianhua Tu
2022 J jnl
Maximal and maximum dissociation sets in general and triangle-free graphs.
Appl. Math. Comput.
Jianhua Tu, Yuxin Li, Junfeng Du
2021 J jnl
On Tree-Connectivity and Path-Connectivity of Graphs.
Graphs Comb.
Shasha Li, Zhongmei Qin, Jianhua Tu, Jun Yue
2021 J jnl
The maximum number of maximum dissociation sets in trees.
J. Graph Theory
Jianhua Tu, Zhipeng Zhang, Yongtang Shi
2020 J jnl
On graph entropy measures based on the number of independent sets and matchings.
Inf. Sci.
Pengfei Wan, Xinzhuang Chen, Jianhua Tu, Matthias Dehmer, Shenggui Zhang, Frank Emmert-Streib
2019 J jnl
A multi-start iterated greedy algorithm for the minimum weight vertex cover
Appl. Math. Comput.
Wenjie Zhang, Jianhua Tu, Lidong Wu
2019 J jnl
An efficient polynomial time approximation scheme for the vertex cover
Discuss. Math. Graph Theory
Yongtang Shi, Jianhua Tu
2019 J jnl
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth.
Discret. Math. Theor. Comput. Sci.
Zongwen Bai, Jianhua Tu, Yongtang Shi
2019 — conf
Design and Implementation of Rapid Detection Platform for Fault of Communication Gateway.
AIAM (IEEE)
Xianglin Tan, Zhichao Shao, Fuqi Qu, Jianhua Tu, Yi'an Wang, Dianchao Zhou
2019 J jnl
Graph entropy based on the number of spanning forests of
Appl. Math. Comput.
Pengfei Wan, Jianhua Tu, Matthias Dehmer, Shenggui Zhang, Frank Emmert-Streib
2019 J jnl
On the complexity of k-rainbow cycle colouring problems.
Discret. Appl. Math.
Shasha Li, Yongtang Shi, Jianhua Tu, Yan Zhao
2019 J jnl
The Turán number of star forests.
Appl. Math. Comput.
Yongxin Lan, Tao Li, Yongtang Shi, Jianhua Tu
2018 J jnl
Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index.
Appl. Math. Comput.
Junqi Fei, Jianhua Tu
2018 J jnl
Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth.
Appl. Math. Comput.
Pengfei Wan, Jianhua Tu, Shenggui Zhang, Binlong Li
2018 J jnl
Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number.
Discuss. Math. Graph Theory
Zemin Jin, Yuefang Sun, Jianhua Tu
2017 J jnl
A kind of conditional connectivity of Cayley graphs generated by wheel graphs.
Appl. Math. Comput.
Jianhua Tu, Yukang Zhou, Guifu Su
2017 J jnl
Efficient algorithm for the vertex cover P
Appl. Math. Comput.
Jianhua Tu
2017 J jnl
On the vertex cover P
J. Comb. Optim.
Jianhua Tu, Lidong Wu, Jing Yuan, Lei Cui
2017 J jnl
The Generalized 3-Connectivity of Cayley Graphs on Symmetric Groups Generated by Trees and Cycles.
Graphs Comb.
Shasha Li, Yongtang Shi, Jianhua Tu
2016 J jnl
An FPT algorithm for the vertex cover P
Discret. Appl. Math.
Jianhua Tu, Zemin Jin
2016 J jnl
An improved algorithm for the vertex cover P
CoRR
Zongwen Bai, Jianhua Tu, Yongtang Shi
2016 J jnl
The generalized 3-connectivity of star graphs and bubble-sort graphs.
Appl. Math. Comput.
Shasha Li, Jianhua Tu, Chenyan Yu
2015 J jnl
A fixed-parameter algorithm for the vertex cover P
Inf. Process. Lett.
Jianhua Tu
2015 J jnl
Graphs with fixed number of pendent vertices and minimal Zeroth-order general Randić index.
Appl. Math. Comput.
Guifu Su, Jianhua Tu, Kinkar Chandra Das
2015 J jnl
Inertia of complex unit gain graphs.
Appl. Math. Comput.
Guihai Yu, Hui Qu, Jianhua Tu
2015 J jnl
On the number of 5-matchings in boron-nitrogen fullerene graphs.
Ars Comb.
Yuchao Li, Junfeng Du, Jianhua Tu
2015 J jnl
The degree resistance distance of cacti.
Discret. Appl. Math.
Junfeng Du, Guifu Su, Jianhua Tu, Ivan Gutman
2015 J jnl
The unicyclic graphs with maximum degree resistance distance.
Appl. Math. Comput.
Jianhua Tu, Junfeng Du, Guifu Su
2014 J jnl
A 2-approximation algorithm for the vertex cover
Int. J. Comput. Math.
Yuchao Li, Jianhua Tu
2014 J jnl
Rainbow numbers for matchings in plane triangulations.
Discret. Math.
Stanislav Jendrol', Ingo Schiermeyer, Jianhua Tu
2013 J jnl
The vertex cover
Inf. Process. Lett.
Jianhua Tu, Fengmei Yang
2011 J jnl
A factor 2 approximation algorithm for the vertex cover P
Inf. Process. Lett.
Jianhua Tu, Wenli Zhou
2011 J jnl
A primal-dual approximation algorithm for the vertex cover P
Theor. Comput. Sci.
Jianhua Tu, Wenli Zhou
2009 J jnl
Bipartite rainbow numbers of matchings.
Discret. Math.
Xueliang Li, Jianhua Tu, Zemin Jin
2009 J jnl
Complete solution for the rainbow numbers of matchings.
Discret. Math.
He Chen, Xueliang Li, Jianhua Tu
2008 J jnl
Heterochromatic tree partition numbers for complete bipartite graphs.
Discret. Math.
He Chen, Zemin Jin, Xueliang Li, Jianhua Tu
2008 J jnl
NP-completeness of 4-incidence colorability of semi-cubic graphs.
Discret. Math.
Xueliang Li, Jianhua Tu
2006 J jnl
NP-completeness of 4-incidence colorability of semi-cubic graphs
CoRR
Xueliang Li, Jianhua Tu