B. Bajnok and G. Brinkmann, On the independence number of triangle free graphs with maximum degree three, J. Combin. Math. Combin. Comput, vol.26, pp.237-254, 1998.

C. Berge, Färbung von graphen, deren sämtliche bzw. deren ungerade kreise starr sind (zusammenfassung), Wiss. Z. Martin-Luther Univ. Halle-Wittenberg, Math.-Natur. Reihe, vol.10, pp.114-115, 1961.

N. Biggs, Constructions for cubic graphs with large girth, Electron. J. Combin, vol.5, p.1, 1998.

B. Bollobás, The independence ratio of regular graphs, Proc. Amer. Math. Soc, vol.83, pp.433-436, 1981.

R. L. Brooks, On colouring the nodes of a network, Proc. Cambridge Philos. Soc, vol.37, pp.194-197, 1941.

M. Chudnovsky, N. Robertson, P. D. Seymour, and R. Thomas, The strong perfect graph theorem, Ann. of Math, vol.164, issue.2, pp.51-229, 2006.
DOI : 10.4007/annals.2006.164.51
URL : http://annals.math.princeton.edu/wp-content/uploads/annals-v164-n1-p02.pdf

E. Davies, R. De-joannis-de-verclos, R. J. Kang, and F. Pirot, Colouring triangle-free graphs with local list sizes, 2018.

G. Exoo and R. Jajcay, Dynamic cage survey, Elec. J. Combin., Dynamic Surveys, p.16, 2008.

K. Fraughnaugh and S. C. Locke, 11/30 (finding large independent sets in connected triangle-free 3-regular graphs), J. Combin. Theory Ser. B, vol.65, pp.51-72, 1995.
DOI : 10.1006/jctb.1995.1043
URL : https://doi.org/10.1006/jctb.1995.1043

K. F. Jones, Independence in graphs with maximum degree four, J. Combin. Theory Ser. B, vol.37, pp.254-269, 1984.
DOI : 10.1016/0095-8956(84)90058-3
URL : https://doi.org/10.1016/0095-8956(84)90058-3

F. Kardo?, D. Král, &. , and J. Volec, Fractional colorings of cubic graphs with large girth, SIAM J. Discrete Math, vol.25, pp.1454-1476, 2011.

A. D. King, , 2009.

A. V. Kostochka, . Degree, and . Number, Combinatorics (Proc. Fifth Hungarian Colloq, vol.II, pp.679-696, 1976.

M. Molloy, The list chromatic number of graphs with small clique number, J. Combin. Theory Ser. B, vol.134, pp.264-284, 2019.

M. Molloy and B. A. Reed, Graph colouring and the probabilistic method, Algorithms and Combinatorics, vol.23, 2002.
DOI : 10.1007/978-3-642-04016-0

J. B. Shearer, A note on the independence number of triangle-free graphs, ii, Journal of Combinatorial Theory, Series B, vol.53, pp.300-307, 1991.

W. Staton, Some Ramsey-type numbers and the independence ratio, Trans. Amer. Math. Soc, vol.256, pp.353-370, 1979.