[1] Appel K. .1977 .Every planar map is four colorable. I. Discharging, Illinois J. , 21 : 429-490.
[2] Appel K. .1977 .Every planar map is four colorable. , 21 : 491-567.
[3] Bondy J. A.,Murty U. S. R. .2008 .. , : .
[4] Hadwiger H. .1943 .. , 88 : 133-142.
[5] Huynh T.,Kim R. .2017 .Tree-chromatic number is not equal to path-chromatic number. J. Graph Theory, 86 : 213-222.
[6] Huynh T.,Reed B.,Wood D. R.,Praeger C. E. .2021 .- and path-chromatic number. MATRIX Annals, : 489-498.
[7] Robertson N.,Seymour P. .1993 .Hadwiger's conjecture for K6-free graphs. Combinatorica, 13 : 279-361.
[8] Seymour P. .2016 .Tree-chromatic number. J. Combin. Theory Ser. B, 116 : 229-237.
[9] Wagner K. .1937 .. , 114 : 570-590.