Shannon switching games without terminals. II

DOI10.1007/BF01788679zbMath0794.90087OpenAlexW4231530574MaRDI QIDQ1812789

Yōhei Yamasaki

Publication date: 25 June 1992

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788679

zbMATH Keywords

graphShannon switching game

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (3)

A difficulty in particular Shannon-like games ⋮ Shannon switching games without terminals. III ⋮ Shannon-like games are difficult

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of connexes. I
• Shannon switching games without terminals. III
• Theory of division games
• Edge-Disjoint Spanning Trees of Finite Graphs
• A Solution of the Shannon Switching Game
• Lehmans switching game and a theorem of Tutte and Nash-Williams

This page was built for publication: Shannon switching games without terminals. II