1. Graph coloring and the immersion order;Abu-Khzam,2003
2. Partitioning into graphs with only small components;Alon;J. Comb. Theory, Ser. B,2003
3. Every planar map is four colorable. I. Discharging;Appel;Ill. J. Math.,1977
4. Every planar map is four colorable. II. Reducibility;Appel;Ill. J. Math.,1977
5. Hajós' graph-coloring conjecture: variations and counterexamples;Catlin;J. Comb. Theory, Ser. B,1979