Bounds on the rubbling and optimal rubbling numbers of graphs (Q2376084): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Rubbling and optimal rubbling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum pebbling number of graphs of diameter three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling and optimal pebbling in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved pebbling bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling in diameter two graphs and products of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinct representatives of subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Graph Pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal pebbling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph Pebbling Algorithm on Weighted Graphs / rank
 
Normal rank

Revision as of 13:36, 6 July 2024

scientific article
Language Label Description Also known as
English
Bounds on the rubbling and optimal rubbling numbers of graphs
scientific article

    Statements

    Bounds on the rubbling and optimal rubbling numbers of graphs (English)
    0 references
    0 references
    0 references
    26 June 2013
    0 references
    pebbling
    0 references
    rubbling
    0 references

    Identifiers