Elimination properties for minimal dominating sets of graphs (Q2107746): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3145697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flips in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining sets, resolving sets, and the exchange property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks about disjoint 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: Uniform clutters and dominating sets of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Revision as of 23:37, 30 July 2024

scientific article
Language Label Description Also known as
English
Elimination properties for minimal dominating sets of graphs
scientific article

    Statements

    Elimination properties for minimal dominating sets of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2022
    0 references
    dominating sets
    0 references
    elimination properties
    0 references
    uniform clutters
    0 references

    Identifiers

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