Peg solitaire on graphs with large maximum degree

DOI10.1142/S1793557122500577MaRDI QIDQ5865955zbMATH OpenOpenAlexFDO

Authors Naoki Matsumoto

Publication date 10 June 2022

Published in Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793557122500577

zbMATH Keywords

combinatorial gamepeg solitairesolvability

Mathematics Subject Classification ID

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

Recommendations

• Reversible peg solitaire on graphs
• Constructing solvable graphs in peg solitaire
• Peg solitaire on graphs with seven vertices or less
• Extremal results for Peg solitaire on graphs
• scientific article; zbMATH DE number 6509361

Cites work

• Graph theory
• scientific article; zbMATH DE number 6509361 (Why is no real title available?)
• Peg solitaire on graphs
• Peg solitaire on the windmill and the double star graphs
• Solitaire lattices
• Solving triangular peg solitaire

Cited in

(9)

• Reversible peg solitaire on graphs
• Freely solvable graphs in peg solitaire
• Peg solitaire on graphs with seven vertices or less
• Extremal results for Peg solitaire on graphs
• scientific article; zbMATH DE number 6509361 (Why is no real title available?)
• Making graphs solvable in peg solitaire
• scientific article; zbMATH DE number 7324072 (Why is no real title available?)
• Pagoda functions for peg solitaire on graphs
• Peg solitaire on graphs -- a survey

This page was built for publication: Peg solitaire on graphs with large maximum degree

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