default search action
Jianhua Tu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j41]Yuting Tian, Jianhua Tu
:
Enumerating maximal dissociation sets in three classes of grid graphs. Appl. Math. Comput. 474: 128711 (2024) - [j40]Jianhua Tu
On the maximum number of maximum dissociation sets in trees with given dissociation number. Discret. Math. 347(5): 113910 (2024) - 2023
- [j39]Junyi Xiao, Jianhua Tu
Maximizing the number of independent sets in claw-free cubic graphs. Appl. Math. Comput. 444: 127812 (2023) - [j38]Ziyuan Wang, Jianhua Tu
Entropy, Graph Homomorphisms, and Dissociation Sets. Entropy 25(1): 163 (2023) - [j37]Lei Zhang, Liming Xiong
Edge-Diameter of a Graph and Its Longest Cycles. Graphs Comb. 39(4): 89 (2023) - [j36]Lei Zhang, Jianhua Tu
Maximum dissociation sets in subcubic trees. J. Comb. Optim. 46(1): 8 (2023) - 2022
- [j35]Jianhua Tu
Maximal and maximum dissociation sets in general and triangle-free graphs. Appl. Math. Comput. 426: 127107 (2022) - [j34]Jianhua Tu
A Survey on the k-Path Vertex Cover Problem. Axioms 11(5): 191 (2022) - 2021
- [j33]Shasha Li, Zhongmei Qin
On Tree-Connectivity and Path-Connectivity of Graphs. Graphs Comb. 37(6): 2521-2533 (2021) - [j32]Jianhua Tu
The maximum number of maximum dissociation sets in trees. J. Graph Theory 96(4): 472-489 (2021) - 2020
- [j31]Pengfei Wan
On graph entropy measures based on the number of independent sets and matchings. Inf. Sci. 516: 491-504 (2020)
2010 – 2019
- 2019
- [j30]Yongxin Lan, Tao Li, Yongtang Shi
The Turán number of star forests. Appl. Math. Comput. 348: 270-274 (2019) - [j29]Wenjie Zhang, Jianhua Tu
A multi-start iterated greedy algorithm for the minimum weight vertex cover P3 problem. Appl. Math. Comput. 349: 359-366 (2019) - [j28]Pengfei Wan
Graph entropy based on the number of spanning forests of c-cyclic graphs. Appl. Math. Comput. 363 (2019) - [j27]Shasha Li, Yongtang Shi
On the complexity of k-rainbow cycle colouring problems. Discret. Appl. Math. 264: 125-133 (2019) - [j26]Yongtang Shi, Jianhua Tu
An efficient polynomial time approximation scheme for the vertex cover P 3 problem on planar graphs. Discuss. Math. Graph Theory 39(1): 55-65 (2019) - [j25]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) - [c1]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: 440-443 - 2018
- [j24]Junqi Fei, Jianhua Tu
Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index. Appl. Math. Comput. 330: 118-124 (2018) - [j23]Pengfei Wan, Jianhua Tu
Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth. Appl. Math. Comput. 332: 42-47 (2018) - [j22]Zemin Jin, Yuefang Sun
Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number. Discuss. Math. Graph Theory 38(4): 1023-1036 (2018) - 2017
- [j21]Jianhua Tu
A kind of conditional connectivity of Cayley graphs generated by wheel graphs. Appl. Math. Comput. 301: 177-186 (2017) - [j20]Jianhua Tu
Efficient algorithm for the vertex cover Pk problem on cacti. Appl. Math. Comput. 311: 217-222 (2017) - [j19]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): 1195-1209 (2017) - [j18]Jianhua Tu
On the vertex cover P3 problem parameterized by treewidth. J. Comb. Optim. 34(2): 414-425 (2017) - 2016
- [j17]Shasha Li, Jianhua Tu
The generalized 3-connectivity of star graphs and bubble-sort graphs. Appl. Math. Comput. 274: 41-46 (2016) - [j16]Jianhua Tu
An FPT algorithm for the vertex cover P4 problem. Discret. Appl. Math. 200: 186-190 (2016) - [i2]Zongwen Bai, Jianhua Tu, Yongtang Shi:
An improved algorithm for the vertex cover P3 problem on graphs of bounded treewidth. CoRR abs/1603.09448 (2016) - 2015
- [j15]Guihai Yu, Hui Qu, Jianhua Tu
Inertia of complex unit gain graphs. Appl. Math. Comput. 265: 619-629 (2015) - [j14]Jianhua Tu
The unicyclic graphs with maximum degree resistance distance. Appl. Math. Comput. 268: 859-864 (2015) - [j13]Guifu Su, Jianhua Tu
Graphs with fixed number of pendent vertices and minimal Zeroth-order general Randić index. Appl. Math. Comput. 270: 705-710 (2015) - [j12]Yuchao Li, Junfeng Du, Jianhua Tu:
On the number of 5-matchings in boron-nitrogen fullerene graphs. Ars Comb. 123: 207-214 (2015) - [j11]Junfeng Du, Guifu Su, Jianhua Tu
The degree resistance distance of cacti. Discret. Appl. Math. 188: 16-24 (2015) - [j10]Jianhua Tu
A fixed-parameter algorithm for the vertex cover P3 problem. Inf. Process. Lett. 115(2): 96-99 (2015) - 2014
- [j9]Stanislav Jendrol'
Rainbow numbers for matchings in plane triangulations. Discret. Math. 331: 158-164 (2014) - [j8]Yuchao Li, Jianhua Tu
A 2-approximation algorithm for the vertex cover P4 problem in cubic graphs. Int. J. Comput. Math. 91(10): 2103-2108 (2014) - 2013
- [j7]Jianhua Tu
The vertex cover P3P3 problem in cubic graphs. Inf. Process. Lett. 113(13): 481-485 (2013) - 2011
- [j6]Jianhua Tu
A factor 2 approximation algorithm for the vertex cover P3 problem. Inf. Process. Lett. 111(14): 683-686 (2011) - [j5]Jianhua Tu
A primal-dual approximation algorithm for the vertex cover P3 problem. Theor. Comput. Sci. 412(50): 7044-7048 (2011)
2000 – 2009
- 2009
- [j4]Xueliang Li, Jianhua Tu
Bipartite rainbow numbers of matchings. Discret. Math. 309(8): 2575-2578 (2009) - [j3]He Chen, Xueliang Li, Jianhua Tu
Complete solution for the rainbow numbers of matchings. Discret. Math. 309(10): 3370-3380 (2009) - 2008
- [j2]Xueliang Li, Jianhua Tu
NP-completeness of 4-incidence colorability of semi-cubic graphs. Discret. Math. 308(7): 1334-1340 (2008) - [j1]He Chen, Zemin Jin, Xueliang Li, Jianhua Tu
Heterochromatic tree partition numbers for complete bipartite graphs. Discret. Math. 308(17): 3871-3878 (2008) - 2006
- [i1]Xueliang Li, Jianhua Tu:
NP-completeness of 4-incidence colorability of semi-cubic graphs. CoRR abs/math/0607071 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: