12 citations · 17 across the 12 of their papers we have counts for
12 papers
A Survey on the k-Path Vertex Cover Problem
Jianhua Tu
Given a graph and a positive integer , a -path vertex cover is a subset of vertices such that every path on vertices in contains at least one vertex…
Maximal and Maximum Dissociation Sets in General and Triangle-Free Graphs
Jianhua Tu, Yuxin Li, Junfeng Du
A subset of vertices in a graph is called a \emph{dissociation set} if the induced subgraph of has maximum degree at most 1. A \emph{maximal dissociation set} of…
On the maximum number of maximum dissociation sets in trees with given dissociation number
Jianhua Tu, Lei Zhang, Junfeng Du
In a graph , a subset of vertices is a dissociation set if it induces a subgraph with vertex degree at most 1. A maximum dissociation set is a dissociation set of maximum cardin…
Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
Jianhua Tu, Lei Zhang, Junfeng Du +1
In a graph G, a dissociation set is a subset of vertices which induces a subgraph with vertex degree at most 1. Finding a dissociation set of maximum cardinality in a graph is NP-h…
Maximum dissociation sets in subcubic trees
Lei Zhang, Jianhua Tu, Chunlin Xin
A subset of vertices in a graph is called a maximum dissociation set if it induces a subgraph with vertex degree at most 1 and the subset has maximum cardinality. The dissociat…
The maximum number of maximum dissociation sets in trees
Tu Jianhua, Zhang Zhipeng, Shi Yongtang
A subset of vertices is a {\it maximum independent set} if no two of the vertices are adjacent and the subset has maximum cardinality. A subset of vertices is called a {\it maximum…