A greedy partition lemma for directed domination (Q665996): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5442546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3088521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the out-domination and in-domination numbers of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Set and Converse Dominating Set of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4378637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed domination in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem in Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of partially ordered sets into chains and antichains of given size / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4108373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050630 / rank
 
Normal rank

Revision as of 23:01, 4 July 2024

scientific article
Language Label Description Also known as
English
A greedy partition lemma for directed domination
scientific article

    Statements

    A greedy partition lemma for directed domination (English)
    0 references
    0 references
    0 references
    7 March 2012
    0 references
    directed domination
    0 references
    oriented graph
    0 references
    independence number
    0 references

    Identifiers