1-restricted optimal rubbling on graphs (Q1717213): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129781646, #quickstatements; #temporary_batch_1727086005326
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.2102 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2804060951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rubbling and optimal rubbling of graphs / 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: Graham's pebbling conjecture on product of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal pebbling number of the complete \(m\)-ary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graham's pebbling conjecture on products of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal rubbling number of ladders, prisms and Möbius-ladders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2857393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling and Graham's conjecture / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129781646 / rank
 
Normal rank

Latest revision as of 11:07, 23 September 2024

scientific article
Language Label Description Also known as
English
1-restricted optimal rubbling on graphs
scientific article

    Statements

    1-restricted optimal rubbling on graphs (English)
    0 references
    0 references
    0 references
    0 references
    7 February 2019
    0 references
    graph pebbling
    0 references
    graph rubbling
    0 references
    optimal rubbling
    0 references
    \(t\)-restricted optimal pebbling
    0 references

    Identifiers