1. Daniel, D., Shauger, S.E.: A result on the Erdős–Gyárfás conjecture in planar graphs. In: Proceedings of the Thirty-Second Southeastern International Conference on Combinatorics, Graph Theory and Computing (Baton Rouge, LA, 2001), vol. 153, pp. 129–139 (2001)
2. Erdős, P.: Some old and new problems in various branches of combinatorics. Discrete Math. 165/166, 227–231 (1997). Graphs and Combinatorics (Marseille, 1995)
3. Heckman, C.C., Krakovski R.: Erdős–Gyárfás conjecture for cubic planar graphs. Electron. J. Comb. 20(2), 7, 43 (2013)
4. Hungerford, T.W.: Algebra, volume 73 of Graduate Texts in Mathematics. Springer, New York (1980)
5. Markström, K.: Extremal graphs for some problems on cycles in graphs. In: Proceedings of the Thirty-Fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol. 171, pp. 179–192 (2004)