Shannon-like games are difficult

DOI10.1016/0012-365X(93)90185-VzbMath0786.90107OpenAlexW2068388510MaRDI QIDQ686516

Yōhei Yamasaki

Publication date: 20 December 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90185-v

zbMATH Keywords

\(n\)-pair gamesShannon switching game

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (1)

Game edge-connectivity of graphs

Cites Work

• Unnamed Item
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• A difficulty in particular Shannon-like games
• Shannon switching games without terminals. III
• Theory of division games
• Shannon switching games without terminals. II

This page was built for publication: Shannon-like games are difficult