References

1

Richard A. Brualdi, Networks and the Shannon switching game, Delta (Waukesha) 4 (1974), 1-23.

2

to3em, Introductory combinatorics, North Holland, New York, 1992.

3

John Bruno and Louis Weinberg, A constructive graph-theortic solution of the shannon switching game, IEEE Trans. Circuit Theory CT-17 (1970), 74-81.

4

Shimon Even and R. Endre Tarjan, A polynomial problem which is complete in polynomial space, Proceedings of the Seventh Annual ACM Symposium on the Theory of Computing, vol. 7, 1975, pp. 66-71.

5

Harold N. Gabow, Forests, frames, and games: algorithms for matroidal sums and applications, Algorithmica 7 (1992), 465-497.

6

Yahya Ould Hamidoune, The directed Shannon switching game and the one-way game, Graph theory with applications to algorithms and computer science (New York), Wiley, New York, 1984, pp. 391-400.

7

to3em, Jeux de commutation orientessur les graph et les matroids, C. R. Acad. Sci Paris Ser. I Math. 298 (1984), 497-499.

8

to3em, Directed switching games on graphs and matroids, J. Combin. Theory Ser. B 40 (1986), 237-269.

9

to3em, A solution to the box game, Discrete Math. 65 (1987), 157-171.

10

to3em, A solution to the misere Shannon switching game, Discrete Math 72 (1988), 163-166.

11

Alfred Lehman, A solution of the Shannon switching game, J. Soc. Indust. Appl. Math 12 (1964), 687-725.

12

Yohei Yamasaki, Shannon switching games without terminals. II, Graphs and Combinatorics 5 (1989), 275-282.

13

to3em, Shannon switching games without terminals. III, Graphs and Combinatorics 8 (1992), 291-297.

14

to3em, Shannon-like games are difficult, Discrete Math. 111 (1993), 481-483.