The maximum number of maximum generalized 4-independent sets in trees
From MaRDI portal
Publication:6606325
Recommendations
Cites work
- scientific article; zbMATH DE number 2192124 (Why is no real title available?)
- A Note on Independent Sets in Trees
- An improved algorithm for the vertex cover \(P_3\) problem on graphs of bounded treewidth
- Independent packings in structured graphs
- Maximal and maximum independent sets in graphs with at mostr cycles
- Maximal independent sets in graphs with at most one cycle
- Maximal independent sets in graphs with at mostr cycles
- Minimum \(k\)-path vertex cover
- NP-hard graph problems and boundary classes of graphs
- Node-Deletion Problems on Bipartite Graphs
- On cliques in graphs
- On the \(k\)-path vertex cover of some graph products
- The Number of Maximal Independent Sets in Triangle-Free Graphs
- The Number of Maximal Independent Sets in a Tree
- The complexity of dissociation set problems in graphs
- The maximum number of maximal independent sets in unicyclic connected graphs
- The maximum number of maximum dissociation sets in trees
- The number of maximal independent sets in a connected graph
- The number of maximal independent sets in connected graphs
- The structure and maximum number of maximum independent sets in trees
This page was built for publication: The maximum number of maximum generalized 4-independent sets in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606325)