The Complexity of Pebbling in Diameter Two Graphs (Q4899034)

From MaRDI portal
Revision as of 17:56, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6121998
Language Label Description Also known as
English
The Complexity of Pebbling in Diameter Two Graphs
scientific article; zbMATH DE number 6121998

    Statements

    The Complexity of Pebbling in Diameter Two Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 January 2013
    0 references
    graph pebbling
    0 references
    diameter two
    0 references
    NP-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references