Optimal pebbling number of graphs with given minimum degree (Q1741506): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 1804.03717 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pebbling and optimal pebbling in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pebbling in Hypercubes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The optimal pebbling number of the complete \(m\)-ary tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The optimal pebbling number of the caterpillar / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Complexity of Graph Pebbling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal pebbling of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4386076 / rank | |||
Normal rank |
Latest revision as of 04:21, 19 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal pebbling number of graphs with given minimum degree |
scientific article |
Statements
Optimal pebbling number of graphs with given minimum degree (English)
0 references
3 May 2019
0 references
graph pebbling
0 references
optimal pebbling
0 references
given minimum degree
0 references