Cycles and girth in pebble assignment graphs (Q2676758): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: On the computational complexity of minimal cumulative cost graph pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling in Hypercubes / 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: Modified linear programming and class 0 bounds for graph pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Girth, Pebbling, and Grid Thresholds / rank
 
Normal rank
Property / cites work
 
Property / cites work: General graph pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing bounds on product graph pebbling numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer-programming bounds on pebbling numbers of Cartesian-product graphs / 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: On properties of pebble assignment 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

Latest revision as of 06:31, 30 July 2024

scientific article
Language Label Description Also known as
English
Cycles and girth in pebble assignment graphs
scientific article

    Statements

    Cycles and girth in pebble assignment graphs (English)
    0 references
    0 references
    28 September 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    pebbling
    0 references
    cycles
    0 references
    girth
    0 references
    assignment graph
    0 references
    multiassignment graph
    0 references
    endstates
    0 references
    dominance
    0 references
    0 references