An improved upper bound for the pebbling threshold of the \(n\)-path (Q1420621): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 18:47, 31 January 2024

scientific article
Language Label Description Also known as
English
An improved upper bound for the pebbling threshold of the \(n\)-path
scientific article

    Statements

    An improved upper bound for the pebbling threshold of the \(n\)-path (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 February 2004
    0 references
    0 references
    Pebbling number
    0 references
    Pebbling threshold
    0 references
    \(n\)-Path
    0 references
    \(n\)-Cycle
    0 references