A tight upper bound for 2-rainbow domination in generalized Petersen graphs (Q2446862): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3277097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination of Cartesian products of graphs and rainbow domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-rainbow domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow domination on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-dual configurations and regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-rainbow domination of generalized Petersen graphs \(P(n,2)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on tait colorings with an application to the generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-rainbow domination in generalized petersen graphs \(P(n,3)\) / rank
 
Normal rank

Latest revision as of 10:04, 8 July 2024

scientific article
Language Label Description Also known as
English
A tight upper bound for 2-rainbow domination in generalized Petersen graphs
scientific article

    Statements

    A tight upper bound for 2-rainbow domination in generalized Petersen graphs (English)
    0 references
    0 references
    0 references
    22 April 2014
    0 references
    domination
    0 references
    rainbow domination
    0 references
    upper bound
    0 references
    generalized Petersen graphs
    0 references

    Identifiers