On the pebbling numbers of flower, Blanuša and Watkins snarks

DOI10.1016/j.dam.2024.10.020MaRDI QIDQ6657240

D. Sasaki, Matheus Adauto, Glenn Hurlbert, C. M. H. de Figueiredo

Publication date: 6 January 2025

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

diametergirthsnarksgraph pebbling

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• General graph pebbling
• The total-chromatic number of some families of snarks
• Snarks of order 18
• Modified linear programming and class 0 bounds for graph pebbling
• The weight function lemma for graph pebbling
• Improved pebbling bounds
• Pebbling in Split Graphs
• Pebbling in Hypercubes
• A survey on snarks and new results: Products, reducibility and a computer search
• Graph Pebbling: A Blend of Graph Theory, Number Theory, and Optimization
• The Complexity of Graph Pebbling
• Remarks on the preceeding communication.

This page was built for publication: On the pebbling numbers of flower, Blanuša and Watkins snarks