A constructive graph-theoretic solution of the Shannon switching game

@inproceedings{Bruno1970ACG,
  title={A constructive graph-theoretic solution of the Shannon switching game},
  author={J. Bruno and Louis Weinberg},
  year={1970}
}
  • J. Bruno, Louis Weinberg
  • Published 1970
  • Mathematics
  • A simple graph-theoretic solution to the Shannon two-person switching game is given. The solution is constructive in that algorithms have been formulated to determine if a game played on any given graph is a short, cut, or a neutral game. The proof makes use of a result due to Kishi and Kajitani, who showed that the edges of any linear graph G can be decomposed into a partition containing three blocks. From this partition one constructs three graphs that form a principal partition denoted by… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 18 CITATIONS

    An Extension of Elementary Bipartite Graphs to Matroid Pairs and its Characterization

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    On the complexity of connection games

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    The Complexity of Playing Durak

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Edge-balance index games

    VIEW 2 EXCERPTS
    CITES METHODS

    Havannah and TwixT are PSPACE-complete

    VIEW 1 EXCERPT
    CITES METHODS

    Playing and solving the game of Hex

    VIEW 1 EXCERPT
    CITES BACKGROUND