Pebbling in Split Graphs

DOI10.1137/130914607zbMath1305.05215arXiv1211.4049OpenAlexW2015837397MaRDI QIDQ2935280

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

Publication date: 22 December 2014

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

Full work available at URL: https://arxiv.org/abs/1211.4049

zbMATH Keywords

complexitygraph algorithmssplit graphsclass 0pebbling number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Pebbling in 2-paths ⋮ On the number of maximal independent sets in minimum colorings of split graphs ⋮ The weight function lemma for graph pebbling ⋮ Pebbling in powers of paths ⋮ Pebbling in semi-2-trees ⋮ Pebbling on Graph Products and other Binary Graph Constructions

This page was built for publication: Pebbling in Split Graphs