(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.
0 Comments
Leave a Reply. |