References
- Berge, C.: Graphs and hypergraphs, revised edn. North-Holland Publishing Co., Amsterdam (1976). Translated from the French by Edward Minieka, North-Holland Mathematical Library, Vol. 6
- Bondy, J.A., Murty, U.S.R.: Graph theory, Graduate Texts in Mathematics, Vol. 244. Springer, New York (2008). http://doi.org/10.1007/978-1-84628-970-5
- Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of combinatorial designs, Second edn. Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, FL (2007)
- Donovan, D., Mahmoodian, E.S., Ramsay, C., Street, A.P.: Defining sets in combinatorics: a survey. In: Surveys in combinatorics, 2003 (Bangor), London Math. Soc. Lecture Note Ser., vol. 307, Cambridge Univ. Press, Cambridge (2003), pp. 115–174.
- Forbes, A.D.: Uniquely 3-colourable Steiner triple systems. J. Combin. Theory Ser. A, vol. 101(1) (2003), pp. 49–68. doi: 10.1016/S0097-3165(02)00016-X
- Forbes, A.D., Grannell, M.J., Griggs, T.S.: On colourings of Steiner triple systems. Discrete Math., vol., 261(1-3) (2003), pp. 255–276. Papers on the occasion of the 65th birthday of Alex Rosa doi: 10.1016/S0012-365X(02)00473-9
- Lindner, C.C., Rodger, C.A.: Design theory, Second edn. Discrete Mathematics and its Applications (Boca Raton). CRC Press, Boca Raton, FL (2009)
- Mahmoodian, E.S., Mendelsohn, E.: On defining numbers of vertex colouring of regular graphs. Discrete Math., vol.197/198 (1999), pp.543–554. 16th British Combinatorial Conference (London, 1997)
- Mahmoodian, E.S., Naserasr, R., Zaker, M.: Defining sets in vertex colorings of graphs and Latin rectangles. Discrete Math., vol.167/168 (1997), pp.451–460. 15th British Combinatorial Conference (1995)
- Mojdeh, D.A., Jafari Rad, N., Khodkar, Abdollah: The defining numbers for vertex colorings of certain graphs, Australasian Journal of Combinatorics., vol. 35 (2006), pp.17–30.
- Mojdeh, D.A.,: Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph, Discussiones Mathematicae Graph Theory., vol. 26(1) (2006), pp.59–72. doi: 10.7151/dmgt.1301
- Perumalsamy, M., Sudhahar, P. Arul Paul, Vasanthi, R., John, J.: The forcing edge fixed Steiner number of a graph, Journal of Statistics and Management Systems., vol. 22(1) (2019), pp. 1–10. doi: 10.1080/09720510.2018.1478622
- Rosa, A.: On the chromatic number of Steiner triple systems. In: Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969), Gordon and Breach, New York (1970), pp. 369–371.
- Rosa, A.: Colouring problems in combinatorial designs. Congr. Numer., vol.56 (1987), pp. 45–52. Sixteenth Manitoba conference on numerical mathematics and computing (Winnipeg, Man., 1986).
- Rosa, A., Colbourn, C.J.: Colorings of block designs. In: Contemporary design theory, Wiley-Intersci. Ser. Discrete Math. Optim., Wiley, New York (1992), pp. 401–430.
- Santhakumaran, A.P., John, J.: The forcing Steiner number of a graph, Discussiones Mathematicae Graph Theory. vol. 31 (2011), pp.171–181. doi: 10.7151/dmgt.1536
- Van Lint, J.H., Wilson, R.M.: A course in combinatorics, Second edn. Cambridge University Press, Cambridge (2001)