#LIGHTSOUT GAME SERIES#

Utilitas Mathematica, Winnipeg (1974)Ĭockayne, E.J., Hedetniemi, S.T.: Towards a theory of domination in graphs. In: Proceedings of the 5th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. Congressus Numerantium 47, 217–228 (1985)Ĭockayne, E.J., Hedetniemi, S.T.: Independence graphs. The Electronic Journal of Combinatorics 7(1, R58), 1–19 (2000)Ĭockayne, E.J., Hare, E.O., Hedetniemi, S.T., Wimer, T.V.: Bounds for the domination number of grid graphs. Ars Combinatoria (2003)Ĭlark, W.E., Suen, S., Dunning, L.A.: Tight upper bounds for the domination numbers of graphs with given order and minimum degree, II. The Electronic Journal of Combinatorics 4(1, R26), 1–25 (1997)Ĭlark, W.E., Ismail, M.E.H., Suen, S.: Application of upper and lower bounds for the domination number to Vizing’s conjecture. Discrete Mathematics 86(1-3), 165–177 (1990)Ĭlark, W.E., Dunning, L.A.: Tight upper bounds for the domination numbers of graphs with given order and minimum degree. Ars Combinatoria 38, 97–111 (1994)Ĭhen, W.Y.C., Gu, N.S.S.: Loop deletion for the lamp lighting problem (2011) (manuscript), Ĭhen, W.Y.C., Li, X., Wang, C., Zhang, X.: The minimum all-ones problem for trees. Journal of Graph Theory 17(1), 81–107 (1993)Ĭhang, T.Y., Clark, W.E., Hare, E.O.: Domination numbers of grid graphs, i. Journal of Combinatorial Mathematics and Combinatorial Computing 44, 65–84 (2003)Ĭaro, Y., Klostermeyer, W.F., Yuster, R.: Connected odd dominating sets in graphs (2011), Ĭhang, T.Y., Clark, W.E.: The domination numbers of the 5× n and the 6× n grid graphs. Discussiones Mathematicae Graph Theory 23, 89–199 (2003)Ĭaro, Y., Klostermeyer, W.: The odd domination number of a graph. arXiv:1207.0953v2 (2012)Ĭaro, Y.: Simple proofs to three parity theorems. Journal of Graph Theory 3, 241–249 (1979)īrandstädt, A., Leitert, A., Rautenbach, D.: Efficient dominating and edge dominating sets for graphs and hypergraphs.

#LIGHTSOUT GAME SERIES#

Journal of Combinatorial Theory, Series B 15, 289–296 (1973)īollobás, B., Cockayne, E.J.: Graph-theoretic parameters concerning domination, independence, and irredundance. 1–8 (1973)īiggs, N.: Perfect codes in graphs. London Mathematical Society Lecture Notes Series, vol. 13, pp. (eds.) Proceedings of the 3rd British Combinatorial Conference (Combinatorics). 321–328 (1977)īiggs, N.: Perfect codes and distance transitive graphs. In: Proceedings of the 8th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. MIT (April 1985)īeyer, T., Proskurowski, A., Hedetniemi, S., Mitchell, S.: Independent domination in trees. IEEE Transactions on Information Theory IT-24, 384–386 (1978)īerman, F., Leighton, F.T., Shor, P., Snyder, L.: Generalized planar matching. Theoretical Computer Science 154(2), 349–366 (1996)īerlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems. Society of Industrial and Applied Mathematics, Philadelphia (1988)īarua, R., Ramakrishnan, S.: σ-game, σ + -game and two-dimensional addititive cellular automata. (eds.) Applications of Discrete Mathematics, pp.

Congressus Numerantium 58, 83–92 (1987)īange, D.W., Barkauskas, A.E., Slater, P.J.: Efficient dominating sets in graphs. PWS Publishing Company, Boston (1997)Īrya, S., Cheng, S.-W., Fleischer, R., Golin, M., Kløve, T., Langermann, S., Leung, Y.C., Na, H.-S., Poon, S.H., Trippen, G., Tsui, H.M., Vigneron, A., Zhou, Z.: Fiver (2002) (manuscript)īange, D.W., Barkauskas, A.E., Host, L.H., Slater, P.J.: Efficient near-dominating of grid graphs. (ed.) Approximation Algorithms for NP-Hard Problems, pp. Mathematical Magazine 71(4), 300–303 (1998)Īrora, S., Lund, C.: Hardness of approximations. Journal of Combinatorial Mathematics and Combinatorial Computing 20, 53–63 (1996)Īnderson, M., Feil, T.: Turning lights out with linear algebra. Congressus Numerantium 91, 19–30 (1992)Īmin, A.T., Slater, P.J.: All parity realizable trees. Discrete Mathematics 187, 1–17 (1998)Īmin, A.T., Slater, P.J.: Neighborhood domination with parity restrictions in graphs. Journal of Graph Theory 17, 177–192 (1993)Īmin, A., Clark, L., Slater, P.: Parity dimension for graphs. Utilitas Mathematica, Winnipeg (1978)Īlon, N., Caro, Y.: On three zero-sum Ramsey-type problems. In: Proceedings of the 9th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. Allan, R.B., Laskar, R.: On domination and some related topics in graph theory.

Lightsout game