[1] APPEL K., HAKEN. W.:
Every planar map is four colorable, Part I: Discharging. Illinois, Math., J. 21, 1977, 429-490.
MR 0543792
[2] APPEL K., HAKEN. W., KOCH. J.:
Every planar map is four colorable, Part II: Reducibility. Illinois, Math., J. 21, 1977, 491-567.
MR 0543793
[4] БУPШTEЙH M. И.:
O биxpoмaтичнocти плocкиx гипepгpaфoв. Cooбщeния AH ГCCP, 78, No.2, 1975, 293-296.
MR 0396314
[6] ERDÖS P., HAJNAL A.:
On chromatic number of graphs and set-systems. Acta Math. Acad. Sci. Hung. 17, 1-2, 1966, 61-99.
MR 0193025
[7] ЗЫKOB A. A.: Teopия кoнeчныx гpaфoв. Hayкa, Hoвocибиpcк 1969.
[8] ЗЫKOB A. A.:
Гиnepгpaфы. УMX, 29:1, 1974, 89-154.
MR 0401556