Cup stacking in graphs

DOI10.1016/j.disc.2024.114097zbMath1541.05122MaRDI QIDQ6553185

Glenn H. Hurlbert, Maya Tennant, Paul Fay

Publication date: 11 June 2024

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

zbMATH Keywords

matchingssymmetric chain decompositionblossom algorithmcup stacking

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chip-firing games on graphs
• Zero forcing parameters and minimum rank problems
• Graph pegging numbers
• On a lemma of Littlewood and Offord on the distribution of certain sums
• A survey of graph burning
• Graph Pebbling: A Blend of Graph Theory, Number Theory, and Optimization
• Paths, Trees, and Flowers
• Solitaire Mancala Games and the Chinese Remainder Theorem
• Kneser graphs are Hamiltonian

This page was built for publication: Cup stacking in graphs