Bounds for the pebbling number of product graphs (Q5104010): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Pebbling on Graph Products and other Binary Graph Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling in Hypercubes / 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: The pebbling number of \(C_5\times C_5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic graph theory. Morphisms, monoids and matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graham's Pebbling Conjecture Holds for the Product of a Graph and a Sufficiently Large Complete Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling and Graham's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Revision as of 01:59, 30 July 2024

scientific article; zbMATH DE number 7583273
Language Label Description Also known as
English
Bounds for the pebbling number of product graphs
scientific article; zbMATH DE number 7583273

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references