Pebbling in semi-2-trees

DOI10.1016/j.disc.2017.02.011zbMath1361.05122OpenAlexW2964197924MaRDI QIDQ526223

Marisa Gutierrez, Liliana Alcón, Glenn H. Hurlbert

Publication date: 10 May 2017

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

Full work available at URL: https://doi.org/10.1016/j.disc.2017.02.011

zbMATH Keywords

complexity\(k\)-trees\(k\)-pathsclass 0pebbling number

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

The weight function lemma for graph pebbling, Graph pebbling algorithms and Lemke graphs, Pebbling in powers of paths, Pebbling on Graph Products and other Binary Graph Constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Pebbling in 2-paths
• \(t\)-pebbling and extensions
• General graph pebbling
• A partial k-arboretum of graphs with bounded treewidth
• The complexity of pebbling reachability and solvability in planar and outerplanar graphs
• Improved pebbling bounds
• Handbook of Graph Theory
• Pebbling in Split Graphs
• Pebbling in Hypercubes
• Pebbling Algorithms in Diameter Two Graphs
• Pebbling in diameter two graphs and products of paths
• The Complexity of Pebbling in Diameter Two Graphs
• Pebbling and optimal pebbling in graphs
• The Complexity of Graph Pebbling