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

From MaRDI portal
Revision as of 22:06, 20 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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