Maximum dissociation sets in subcubic trees
From MaRDI portal
Publication:6176408
DOI10.1007/s10878-023-01076-9arXiv2005.03335MaRDI QIDQ6176408
Lei Zhang, Chunlin Xin, Jian-hua Tu
Publication date: 22 August 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.03335
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on the maximum number of minimum dominating sets
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
- A faster FPT algorithm for 3-path vertex cover
- The maximum number of maximal independent sets in unicyclic connected graphs
- The number of maximal independent sets in a connected graph
- On the maximum number of minimum dominating sets in forests
- On the maximum number of maximum independent sets
- Minimum \(k\)-path vertex cover
- The complexity of dissociation set problems in graphs
- NP-hard graph problems and boundary classes of graphs
- Independent packings in structured graphs
- Improper coloring of unit disk graphs
- Maximal independent sets in bipartite graphs
- Maximal and maximum independent sets in graphs with at mostr cycles
- The Number of Maximal Independent Sets in a Tree
- A Note on Independent Sets in Trees
- The number of maximal independent sets in connected graphs
- Node-Deletion Problems on Bipartite Graphs
- The structure and maximum number of maximum independent sets in trees
- A New Algorithm for Generating All the Maximal Independent Sets
- Proximity Search for Maximal Subgraph Enumeration
- Algorithms and Computation
- On cliques in graphs
- The number of maximum independent sets in graphs
- The maximum number of maximum dissociation sets in trees
- On the maximum number of maximum independent sets in connected graphs
This page was built for publication: Maximum dissociation sets in subcubic trees