Minimum number of maximal dissociation sets in trees (Q6193972): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the maximum number of minimum dominating sets in forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Induced Matchings in Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-path vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the maximum number of minimum dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration and maximum number of minimal connected vertex covers in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper coloring of unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the minimum 3-path vertex cover and dissociation number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of maximal independent sets in unicyclic connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of independent sets in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraints on the number of maximal independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of dissociation set problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal and maximum independent sets in graphs with at mostr cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some generalizations of the maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal and maximum dissociation sets in general and triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of maximum dissociation sets in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all trees have an even number of independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Maximal Independent Sets in a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with extremal numbers of maximal independent sets including the set of leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for maximum independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Exact Algorithm for Maximum Induced Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure and maximum number of maximum independent sets in trees / rank
 
Normal rank

Revision as of 14:29, 26 August 2024

scientific article; zbMATH DE number 7804733
Language Label Description Also known as
English
Minimum number of maximal dissociation sets in trees
scientific article; zbMATH DE number 7804733

    Statements

    Minimum number of maximal dissociation sets in trees (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2024
    0 references
    maximal dissociation set
    0 references
    extremal graph
    0 references
    tree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references