On the pebbling number of \(\mathcal{C}_m \times \mathcal{C}_n\) in case of even parity (Q1625785): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2018.10.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2899537687 / 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: Graham's pebbling conjecture on products of cycles / 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: An addition theorem on the integers modulo \(n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3551196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph Pebbling Algorithm on Weighted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-pebbling property and a conjecture of Graham's / rank
 
Normal rank

Latest revision as of 13:29, 17 July 2024

scientific article
Language Label Description Also known as
English
On the pebbling number of \(\mathcal{C}_m \times \mathcal{C}_n\) in case of even parity
scientific article

    Statements

    On the pebbling number of \(\mathcal{C}_m \times \mathcal{C}_n\) in case of even parity (English)
    0 references
    0 references
    29 November 2018
    0 references
    0 references
    pebbles
    0 references
    Graham's conjecture
    0 references
    0 references