On generalized independent subsets of trees
From MaRDI portal
Publication:3974711
DOI10.1002/RSA.3240020204zbMATH Open0738.05032OpenAlexW2083192931MaRDI QIDQ3974711FDOQ3974711
Authors: Michael Drmota, Peter Kirschenhofer
Publication date: 25 June 1992
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240020204
Recommendations
- A Note on Independent Sets in Trees
- Independent sets in trees
- On independent \([1, 2]\)-sets in trees
- On the number of independent sets in a tree
- On the number of independent subsets in trees with restricted degrees
- On intersecting families of independent sets in trees
- On the independent set sequence of a tree
- On the independence number of some random trees
- On subgraph number independence in trees
- scientific article; zbMATH DE number 5904022
Cites Work
Cited In (9)
- The maximum number of maximum generalized 4-independent sets in trees
- On \(k\)-independent sets in special products of graphs
- On \(S_0\)-free forests with man independent sets
- Subset counting in trees
- THE EXFECTED INDEPENDENT DOMINATION NUMBER OF TWO TYPES OF TREES
- On trees with given diameter and extremal number of distance-\(k\) independent sets
- The number of 1-nearly independent vertex subsets
- Invariant subsets of scattered trees and the tree alternative property of Bonato and Tardif
- A Note on Independent Sets in Trees
This page was built for publication: On generalized independent subsets of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974711)