$k$-Efficient partitions of graphs (Q5242941): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3815323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between packing and covering numbers of a tree / rank
 
Normal rank

Revision as of 21:31, 20 July 2024

scientific article; zbMATH DE number 7128179
Language Label Description Also known as
English
$k$-Efficient partitions of graphs
scientific article; zbMATH DE number 7128179

    Statements

    0 references
    0 references
    0 references
    8 November 2019
    0 references
    domination
    0 references
    efficient domination
    0 references
    distance-\(k\) domination
    0 references
    $k$-Efficient partitions of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers