Jianhua Tu

From MaRDI portal
Person:403487

Available identifiers

zbMath Open tu.jianhuaMaRDI QIDQ403487

List of research outcomes





PublicationDate of PublicationType
Enumerating maximal dissociation sets in three classes of grid graphs2024-08-12Paper
On the maximum number of maximum dissociation sets in trees with given dissociation number2024-03-27Paper
The maximum number of maximum dissociation sets in trees2023-09-29Paper
Maximum dissociation sets in subcubic trees2023-08-22Paper
Edge-diameter of a graph and its longest cycles2023-08-21Paper
Maximizing the number of independent sets in claw-free cubic graphs2023-04-21Paper
Maximal and maximum dissociation sets in general and triangle-free graphs2022-05-23Paper
Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree2022-04-25Paper
A Survey on the k-Path Vertex Cover Problem2022-01-10Paper
On tree-connectivity and path-connectivity of graphs2021-11-30Paper
On graph entropy measures based on the number of independent sets and matchings2021-03-31Paper
Maximal and Maximum Dissociation Sets in General and Triangle-Free Graphs2021-03-01Paper
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth2020-01-13Paper
Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs2020-01-09Paper
The Turán number of star forests2019-11-26Paper
A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem2019-11-26Paper
Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth2019-11-12Paper
Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index2019-09-02Paper
On the complexity of \(k\)-rainbow cycle colouring problems2019-06-20Paper
Efficient algorithm for the vertex cover \(P_k\) problem on cacti2019-04-29Paper
A kind of conditional connectivity of Cayley graphs generated by wheel graphs2019-03-28Paper
The generalized 3-connectivity of star graphs and bubble-sort graphs2019-03-19Paper
The unicyclic graphs with maximum degree resistance distance2019-03-18Paper
An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs2018-12-05Paper
Inertia of complex unit gain graphs2018-08-24Paper
The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles2017-12-12Paper
On the vertex cover \(P_3\) problem parameterized by treewidth2017-10-17Paper
Bicyclic graphs with maximum degree resistance distance2017-07-19Paper
On the number of 5-matchings in boron-nitrogen fullerene graphs.2016-10-26Paper
An FPT algorithm for the vertex cover \(P_4\) problem2016-01-21Paper
The degree resistance distance of cacti2015-05-22Paper
A fixed-parameter algorithm for the vertex cover \(P_3\) problem2014-12-09Paper
A 2-approximation algorithm for the vertex coverP4problem in cubic graphs2014-11-28Paper
An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem2014-08-29Paper
Rainbow numbers for matchings in plane triangulations2014-08-08Paper
The vertex cover \(P_3\) problem in cubic graphs2014-04-11Paper
https://portal.mardi4nfdi.de/entity/Q54082952014-04-09Paper
A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem2013-04-04Paper
A primal-dual approximation algorithm for the vertex cover \(P^3\) problem2011-12-07Paper
Submodular potential function for the minimum color spanning tree problem of edge-colored graphs2010-02-12Paper
Complete solution for the rainbow numbers of matchings2009-06-23Paper
Bipartite rainbow numbers of matchings2009-06-19Paper
Heterochromatic tree partition numbers for complete bipartite graphs2008-07-11Paper
NP-completeness of 4-incidence colorability of semi-cubic graphs2008-02-11Paper
Heterochromatic tree partition number of a complete multipartite graph2005-11-22Paper

Research outcomes over time

This page was built for person: Jianhua Tu