Enumeration of maximal irredundant sets for claw-free graphs (Q1628586): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Enumerating minimal dominating sets in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast branching algorithm for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. V. Global structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the theory of domination, independence and irredundance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal dominating sets in graph classes: combinatorial bounds and enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of minimal dominating sets on some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Private Neighbor Cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms via Monotone Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds via measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating minimal dominating sets in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An incremental polynomial time algorithm to enumerate all minimal edge dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration and maximum number of maximal irredundant sets for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Maximal Irredundant Sets for Claw-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3791195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal graphs and upper irredundance, upper domination and independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Minimal Dominating Sets and Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Enumeration of Minimal Dominating Sets and Related Notions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees having many minimal dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank

Latest revision as of 14:33, 17 July 2024

scientific article
Language Label Description Also known as
English
Enumeration of maximal irredundant sets for claw-free graphs
scientific article

    Statements

    Enumeration of maximal irredundant sets for claw-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 December 2018
    0 references
    enumeration
    0 references
    irredundant sets
    0 references
    claw-free graphs
    0 references
    0 references
    0 references

    Identifiers