A Note on Independent Sets in Trees
From MaRDI portal
Publication:3789596
DOI10.1137/0401012zbMath0646.05036OpenAlexW2050392684MaRDI QIDQ3789596
Publication date: 1988
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0401012
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The number of maximal independent sets in trees with a given number of leaves, Graphs, partitions and Fibonacci numbers, Maximal and maximum dissociation sets in general and triangle-free graphs, Constraints on the number of maximal independent sets in graphs, The number of maximal independent sets in a connected graph, Maximal independent sets in graphs with at most one cycle, Maximal independent sets on a grid graph, Maximum modulus of independence roots of graphs and trees, Trees with maximum number of maximal matchings, The maximum number of maximum dissociation sets in trees, Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets, On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza, The number of maximum matchings in a tree, On radius 2 trees with the maximum number of matchings, Maximum dissociation sets in subcubic trees, On the maximum number of maximum dissociation sets in trees with given dissociation number, On the Number ofk-Dominating Independent Sets, The maximum number of maximal independent sets in unicyclic connected graphs, On the number of minimal transversals in 3-uniform hypergraphs, On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs, Trees with extremal numbers of maximal independent sets including the set of leaves, Independent sets in graphs, Maximal independent sets and maximal matchings in series-parallel and related graph classes, On the number of 2-packings in a connected graph, On graphs with the third largest number of maximal independent sets, The independent set sequence of some families of trees, The number of maximal independent sets of \((k+1)\)-valent trees, Coverings, Matchings and the number of maximal independent sets of graphs, Trees with a given number of leaves and the maximal number of maximum independent sets, Graphs with the second largest number of maximal independent sets, Maximal independent sets and maximal matchings in series-parallel and related graph classes, Maximal independent sets in caterpillar graphs, A finiteness theorem for maximal independent sets, The number of maximal independent sets in connected triangle-free graphs, Maximal independent sets in bipartite graphs, The maximum clique problem
