On the target pebbling conjecture

DOI10.1007/978-3-031-52969-6_16zbMATH Open1548.05239MaRDI QIDQ6616817

Glenn H. Hurlbert, Essak Seddiq

Publication date: 9 October 2024

zbMATH Keywords

Kneser graphgraph pebblingtarget distribution2-pathtarget conjecturepebbling configuration

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Games involving graphs (91A43) Transportation, logistics and supply chain management (90B06) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pebbling in 2-paths
• \(t\)-pebbling and extensions
• General graph pebbling
• Generalizations of Graham's pebbling conjecture
• Pebbling in semi-2-trees
• The \(t\)-pebbling number is eventually linear in \(t\)
• Sparse hypergraphs and pebble game algorithms
• Hamiltonian uniform subset graphs
• Searching and pebbling
• The cover pebbling number of graphs
• The cover pebbling theorem
• Pebbling in powers of paths
• Pebbling in Split Graphs
• Pebbling in Hypercubes
• An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
• The Pebbling Problem is Complete in Polynomial Space
• Complete Register Allocation Problems
• On Time Versus Space
• On finite rigid structures

This page was built for publication: On the target pebbling conjecture

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