Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Shannon switching games without terminals. III

From MaRDI portal
Publication:1199126
Jump to:navigation, search

DOI10.1007/BF02349966zbMath0794.90088MaRDI QIDQ1199126

Yōhei Yamasaki

Publication date: 16 January 1993

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


zbMATH Keywords

matroidShannon switching games


Mathematics Subject Classification ID

Games involving graphs (91A43) Combinatorial aspects of matroids and geometric lattices (05B35)


Related Items (4)

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




Cites Work

  • Directed switching games on graphs and matroids
  • A difficulty in particular Shannon-like games
  • Shannon switching games without terminals. III
  • Theory of division games
  • Shannon switching games without terminals. II
  • A Solution of the Shannon Switching Game




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1199126&oldid=13265045"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki