Documents Related by Co-Citation

117 The Four-Colour Theorem – Neil Robertson, Daniel Sanders, Paul Seymour, Robin Thomas - 1997
281 Every planar map is four-colorable – K Appel, W Haken - 1977
57 The four-color problem – O Ore - 1967
23 The four-color problem. Assaults and conquest – T L Saaty, P C Kainen - 1986
20 Map coloring and the vector cross product – Louis Kauffman - 1990
33 Every planar map is four colorable. part II. reducibility – K Appel, W Haken - 1977
70 Über eine Klassifikation der Streckenkomplexe – H Hadwiger - 1943
28 A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs – László Lovász, Alexander Schrijver
12 Thirteen colorful variations on Guthrie’s four-color conjecture – T L Saaty
38 Every planar map is four colorable. part I. discharging – K Appel, W Haken - 1977
26 A New Proof Of The Four-Colour Theorem – Neil Robertson, Daniel P. Sanders, Paul Seymour, Robin Thomas - 1996
10 Matrices of sign-solvable linear systems, Cambridge U – R A Brualdi, B Shader
21 Characterization of even directed graphs – P Seymour, C Thomassen - 1987
23 Even cycles in directed graphs – C Thomassen - 1985
24 The even cycle problem for directed graphs – Carsten Thomassen - 1992
259 Graph minors. XIII. The disjoint paths problem – N Robertson, P D Seymour - 1995
35 Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs – V V Vazirani, M Yannakakis - 1989
49 Sachs’ linkless embedding conjecture – N Robertson, P Seymour, R Thomas - 1995
18 Sign-nonsingular matrices and even cycles in directed graphs – C Thomassen - 1986