Pebbling in semi-2-trees

DOI10.1016/J.DISC.2017.02.011zbMATH Open1361.05122OpenAlexW2964197924MaRDI QIDQ526223FDOQ526223

Glenn H. Hurlbert, M. Gutierrez, L. Alcón

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) Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

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

Cited In (6)

• Pebbling on Graph Products and other Binary Graph Constructions
• The weight function lemma for graph pebbling
• On the target pebbling conjecture
• Graph pebbling algorithms and Lemke graphs
• Pebbling in powers of paths
• Pebbling in Kneser graphs

This page was built for publication: Pebbling in semi-2-trees

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