Jianhua Tu

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 28

Top Topics

Bounded Treewidth

Tree Decompositions

Graph Theoretic

Top Venues

Appl. Math. Comput.

Discret. Appl. Math.

J. Comb. Optim.

Publications

Yuting Tian, Jianhua Tu
Enumerating maximal dissociation sets in three classes of grid graphs. Appl. Math. Comput. 474 (2024)
Jianhua Tu, Lei Zhang, Junfeng Du
On the maximum number of maximum dissociation sets in trees with given dissociation number. Discret. Math. 347 (5) (2024)
Ziyuan Wang, Jianhua Tu, Rongling Lang
Entropy, Graph Homomorphisms, and Dissociation Sets. Entropy 25 (1) (2023)
Junyi Xiao, Jianhua Tu
Maximizing the number of independent sets in claw-free cubic graphs. Appl. Math. Comput. 444 (2023)
Lei Zhang, Jianhua Tu, Chunlin Xin
Maximum dissociation sets in subcubic trees. J. Comb. Optim. 46 (1) (2023)
Lei Zhang, Liming Xiong, Jianhua Tu
Edge-Diameter of a Graph and Its Longest Cycles. Graphs Comb. 39 (4) (2023)
Jianhua Tu, Yuxin Li, Junfeng Du
Maximal and maximum dissociation sets in general and triangle-free graphs. Appl. Math. Comput. 426 (2022)
Jianhua Tu
A Survey on the k-Path Vertex Cover Problem. Axioms 11 (5) (2022)
Jianhua Tu, Zhipeng Zhang, Yongtang Shi
The maximum number of maximum dissociation sets in trees. J. Graph Theory 96 (4) (2021)
Shasha Li, Zhongmei Qin, Jianhua Tu, Jun Yue
On Tree-Connectivity and Path-Connectivity of Graphs. Graphs Comb. 37 (6) (2021)
Pengfei Wan, Xinzhuang Chen, Jianhua Tu, Matthias Dehmer, Shenggui Zhang, Frank Emmert-Streib
On graph entropy measures based on the number of independent sets and matchings. Inf. Sci. 516 (2020)
Pengfei Wan, Jianhua Tu, Matthias Dehmer, Shenggui Zhang, Frank Emmert-Streib
-cyclic graphs. Appl. Math. Comput. 363 (2019)
Yongxin Lan, Tao Li, Yongtang Shi, Jianhua Tu
The Turán number of star forests. Appl. Math. Comput. 348 (2019)
Xianglin Tan, Zhichao Shao, Fuqi Qu, Jianhua Tu, Yi'an Wang, Dianchao Zhou
Design and Implementation of Rapid Detection Platform for Fault of Communication Gateway. AIAM (IEEE) (2019)
Shasha Li, Yongtang Shi, Jianhua Tu, Yan Zhao
On the complexity of k-rainbow cycle colouring problems. Discret. Appl. Math. 264 (2019)
Zongwen Bai, Jianhua Tu, Yongtang Shi
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth. Discret. Math. Theor. Comput. Sci. 21 (4) (2019)
Yongtang Shi, Jianhua Tu
problem on planar graphs. Discuss. Math. Graph Theory 39 (1) (2019)
Wenjie Zhang, Jianhua Tu, Lidong Wu
problem. Appl. Math. Comput. 349 (2019)
Zemin Jin, Yuefang Sun, Jianhua Tu
Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number. Discuss. Math. Graph Theory 38 (4) (2018)
Junqi Fei, Jianhua Tu
Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index. Appl. Math. Comput. 330 (2018)
Pengfei Wan, Jianhua Tu, Shenggui Zhang, Binlong Li
Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth. Appl. Math. Comput. 332 (2018)
Jianhua Tu, Lidong Wu, Jing Yuan, Lei Cui
problem parameterized by treewidth. J. Comb. Optim. 34 (2) (2017)
Shasha Li, Yongtang Shi, Jianhua Tu
The Generalized 3-Connectivity of Cayley Graphs on Symmetric Groups Generated by Trees and Cycles. Graphs Comb. 33 (5) (2017)
Jianhua Tu
problem on cacti. Appl. Math. Comput. 311 (2017)
Jianhua Tu, Yukang Zhou, Guifu Su
A kind of conditional connectivity of Cayley graphs generated by wheel graphs. Appl. Math. Comput. 301 (2017)
Jianhua Tu, Zemin Jin
problem. Discret. Appl. Math. 200 (2016)
Shasha Li, Jianhua Tu, Chenyan Yu
The generalized 3-connectivity of star graphs and bubble-sort graphs. Appl. Math. Comput. 274 (2016)
Zongwen Bai, Jianhua Tu, Yongtang Shi
problem on graphs of bounded treewidth. CoRR (2016)
Guihai Yu, Hui Qu, Jianhua Tu
Inertia of complex unit gain graphs. Appl. Math. Comput. 265 (2015)
Jianhua Tu, Junfeng Du, Guifu Su
The unicyclic graphs with maximum degree resistance distance. Appl. Math. Comput. 268 (2015)
Junfeng Du, Guifu Su, Jianhua Tu, Ivan Gutman
The degree resistance distance of cacti. Discret. Appl. Math. 188 (2015)
Guifu Su, Jianhua Tu, Kinkar Chandra Das
Graphs with fixed number of pendent vertices and minimal Zeroth-order general Randić index. Appl. Math. Comput. 270 (2015)
Jianhua Tu
problem. Inf. Process. Lett. 115 (2) (2015)
Yuchao Li, Junfeng Du, Jianhua Tu
On the number of 5-matchings in boron-nitrogen fullerene graphs. Ars Comb. 123 (2015)
Stanislav Jendrol', Ingo Schiermeyer, Jianhua Tu
Rainbow numbers for matchings in plane triangulations. Discret. Math. 331 (2014)
Yuchao Li, Jianhua Tu
problem in cubic graphs. Int. J. Comput. Math. 91 (10) (2014)
Jianhua Tu, Fengmei Yang
P3 problem in cubic graphs. Inf. Process. Lett. 113 (13) (2013)
Jianhua Tu, Wenli Zhou
problem. Inf. Process. Lett. 111 (14) (2011)
Jianhua Tu, Wenli Zhou
problem. Theor. Comput. Sci. 412 (50) (2011)
Xueliang Li, Jianhua Tu, Zemin Jin
Bipartite rainbow numbers of matchings. Discret. Math. 309 (8) (2009)
He Chen, Xueliang Li, Jianhua Tu
Complete solution for the rainbow numbers of matchings. Discret. Math. 309 (10) (2009)
Xueliang Li, Jianhua Tu
NP-completeness of 4-incidence colorability of semi-cubic graphs. Discret. Math. 308 (7) (2008)
He Chen, Zemin Jin, Xueliang Li, Jianhua Tu
Heterochromatic tree partition numbers for complete bipartite graphs. Discret. Math. 308 (17) (2008)
Xueliang Li, Jianhua Tu
NP-completeness of 4-incidence colorability of semi-cubic graphs CoRR (2006)