Pebbling in Kneser graphs

DOI10.1007/978-3-031-55601-2_4MaRDI QIDQ6547946

Glenn Hurlbert, [[Person:6136000|Author name not available (Why is that?)]], C. M. H. de Figueiredo, D. Sasaki, M. da Cruz, Matheus Adauto

Publication date: 31 May 2024

zbMATH Keywords

weight function methodKneser graphsgraph pebblingodd graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pebbling in semi-2-trees
• A note on graph pebbling
• Modified linear programming and class 0 bounds for graph pebbling
• The weight function lemma for graph pebbling
• Improved pebbling bounds
• On the diameter of Kneser graphs
• Pebbling in powers of paths
• Pebbling in Split Graphs
• Pebbling in Hypercubes
• Pebbling in diameter two graphs and products of paths

This page was built for publication: Pebbling in Kneser graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547946)