Modified linear programming and class 0 bounds for graph pebbling (Q2410032): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maximum pebbling number of graphs of diameter three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling in Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Graph Pebbling / 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: Q5841589 / 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: Pebbling numbers of some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5704408 / 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: Graham's pebbling conjecture on products of many cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An addition theorem on the integers modulo \(n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling Graphs of Fixed Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling Graphs of Diameter Three and Four / rank
 
Normal rank

Latest revision as of 13:19, 14 July 2024

scientific article
Language Label Description Also known as
English
Modified linear programming and class 0 bounds for graph pebbling
scientific article

    Statements

    Modified linear programming and class 0 bounds for graph pebbling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 October 2017
    0 references
    pebbling
    0 references
    class 0
    0 references
    linear programming
    0 references
    Lemke
    0 references

    Identifiers