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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00373-012-1146-2 / rank
Normal rank
 
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
Property / DOI
 
Property / DOI: 10.1007/S00373-012-1146-2 / rank
 
Normal rank

Latest revision as of 06:54, 18 December 2024

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

    Statements

    Identifiers