Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6237427 / rank
 
Normal rank
Property / zbMATH Keywords
 
minimal dominating sets
Property / zbMATH Keywords: minimal dominating sets / rank
 
Normal rank
Property / zbMATH Keywords
 
enumeration algorithms
Property / zbMATH Keywords: enumeration algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial bounds
Property / zbMATH Keywords: combinatorial bounds / rank
 
Normal rank
Property / zbMATH Keywords
 
graph classes
Property / zbMATH Keywords: graph classes / rank
 
Normal rank

Revision as of 14:07, 29 June 2023

scientific article
Language Label Description Also known as
English
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
scientific article

    Statements

    Minimal dominating sets in graph classes: combinatorial bounds and enumeration (English)
    0 references
    0 references
    0 references
    0 references
    11 December 2013
    0 references
    minimal dominating sets
    0 references
    enumeration algorithms
    0 references
    combinatorial bounds
    0 references
    graph classes
    0 references

    Identifiers