The following pages link to (Q4386076):
Displaying 14 items.
- The t-pebbling number of Lamp graphs (Q3295226) (← links)
- (Q3390712) (← links)
- The t-pebbling number of Jahangir graph J3,m (Q3460031) (← links)
- Pebbling on Graph Products and other Binary Graph Constructions (Q4616105) (← links)
- Monophonic pebbling number and <i>t</i>-pebbling number of some graphs (Q5097777) (← links)
- On the plurality of graphs (Q5103724) (← links)
- (Q5137464) (← links)
- PEBBLING ON THE MIDDLE GRAPH OF A COMPLETE BINARY TREE (Q5205529) (← links)
- Herscovici’s conjecture on C2n × G (Q5858181) (← links)
- Strict optimal rubbling of graphs (Q6064866) (← links)
- (Q6113436) (← links)
- Automating weight function generation in graph pebbling (Q6202944) (← links)
- Pebbling in Kneser graphs (Q6547946) (← links)
- Restricted optimal pebbling is NP-hard (Q6611025) (← links)