Eternal dominating sets on digraphs and orientations of graphs (Q2659065): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4820838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5441054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3635564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protecting a graph with mobile guards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank

Latest revision as of 20:23, 24 July 2024

scientific article
Language Label Description Also known as
English
Eternal dominating sets on digraphs and orientations of graphs
scientific article

    Statements

    Eternal dominating sets on digraphs and orientations of graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2021
    0 references
    eternal domination
    0 references
    \(m\)-eternal domination
    0 references
    directed graphs
    0 references
    graph orientations
    0 references

    Identifiers

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