Cup stacking in graphs

DOI10.1016/J.DISC.2024.114097MaRDI QIDQ6553185zbMATH OpenFDO

Authors Paul Fay, Glenn H. Hurlbert, Maya Tennant

Publication date 11 June 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114097

zbMATH Keywords

blossom algorithmcup stackingmatchingssymmetric chain decomposition

Mathematics Subject Classification ID

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

Recommendations

• The matroid cup game
• Graph pegging numbers
• A solitaire game played on 2-colored graphs

Cites work

• A survey of graph burning
• Chip-firing games on graphs
• Graph pebbling: a blend of graph theory, number theory, and optimization
• Graph pegging numbers
• scientific article; zbMATH DE number 3220175 (Why is no real title available?)
• scientific article; zbMATH DE number 3232667 (Why is no real title available?)
• Kneser graphs are Hamiltonian
• On a lemma of Littlewood and Offord on the distribution of certain sums
• Paths, Trees, and Flowers
• Solitaire Mancala Games and the Chinese Remainder Theorem
• The game of cops and robbers on graphs
• Zero forcing parameters and minimum rank problems

Cited in

(2)

• The matroid cup game
• Graphs that admit a Hamilton path are cup-stackable

This page was built for publication: Cup stacking in graphs

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