12 citations · 17 across the 12 of their papers we have counts for
Showing 2021 · math.COShow all
3 papers · 2 filters
math.CO2021★ 1 cited
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…
math.CO2021
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…
math.CO2021
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…