|
98
|
The Four-Colour Theorem
– Neil Robertson, Daniel Sanders, Paul Seymour, Robin Thomas
- 1997
|
|
224
|
Every planar map is four-colorable
– K Appel, W Haken
- 1976
|
|
41
|
The Four Color Problem
– O Ore
- 1967
|
|
20
|
The four color problem, assaults and conquest
– T L Saaty, P C Kainen
- 1977
|
|
17
|
Map coloring and the vector cross-product
– L H Kauffman
- 1990
|
|
26
|
Every planar map is four-colorable, Part II: Reducibility
– K Appel, W Haken, J Koch
- 1989
|
|
54
|
Über eine Klassifikation der Streckenkomplexe, Vierteljschr
– H Hadwiger
- 1943
|
|
26
|
A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
– László Lovász, Alexander Schrijver
|
|
10
|
Thirteen colorful variations on guthrie’s four-color conjecture
– T L Saaty
- 1972
|
|
29
|
Every planar map is four colorable, Part I: Discharging
– K Appel, W Haken
- 1977
|
|
20
|
A New Proof Of The Four-Colour Theorem
– Neil Robertson, Daniel P. Sanders, Paul Seymour, Robin Thomas
- 1996
|
|
16
|
Colorings and girth of oriented planar graphs. Discrete Math
– J Nesetril, A Raspaud, E Sopena
- 1997
|
|
16
|
Combinatorial Problems and Exercises, North Holland Pub
– L Lovász
- 1979
|
|
1231
|
Theory of Linear and Integer Programming
– A Schrijver
- 1986
|
|
16
|
Symmetric graphs and interpretations
– E Welzl
- 1984
|
|
185
|
Graphs and Homomorphisms
– P Hell, J Nesetril
- 2004
|
|
25
|
Grötzsch’s 3-color theorem and its counterparts for the torus and the projective plane
– C Thomassen
- 1994
|
|
30
|
de Verdière, Sur un nouvel invariant des graphes et un critère de planarité
– Y Colin
- 1990
|
|
20
|
The even cycle problem for directed graphs
– Carsten Thomassen
- 1992
|