1. Many T copies in H-free graphs;Alon;J. Combin. Theory Ser. B,2016
2. Every planar map is four colorable. Part I: Discharging;Appel;Illinois J. Math.,1977
3. Every planar map is four colorable. Part II: Reducibility;Appel;Illinois J. Math.,1977
4. Spectra of Graphs. Theory and Applications;Cvetković,1980
5. A property of 4-chromatic graphs and some remarks on critical graphs;Dirac;J. Lond. Math. Soc.,1952