Five color theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Five color theorem" in English language version.

refsWebsite

Global rank English rank

2^nd place

451^st place

277^th place

179^th place

183^rd place

207^th place

136^th place

4,448^th place

2,923^rd place

26^th place

20^th place

ams.org

Lipton, Richard J.; Miller, Raymond E. (1978), "A batching method for coloring planar graphs", Information Processing Letters, 7 (4): 185–188, doi:10.1016/0020-0190(78)90065-0, MR 0497394
Chiba, Norishige; Nishizeki, Takao; Saito, Nobuji (1981), "A linear 5-coloring algorithm of planar graphs", Journal of Algorithms, 2 (4): 317–327, doi:10.1016/0196-6774(81)90031-6, MR 0640516
Frederickson, Greg N. (1984), "On linear-time algorithms for five-coloring planar graphs", Information Processing Letters, 19 (5): 219–224, CiteSeerX 10.1.1.158.5812, doi:10.1016/0020-0190(84)90056-5, MR 0777802
Williams, M. H. (1985), "A linear algorithm for colouring planar graphs with five colours", The Computer Journal, 28 (1): 78–81, doi:10.1093/comjnl/28.1.78, MR 0786929
Hagerup, Torben; Chrobak, Marek; Diks, Krzysztof (1989), "Optimal parallel 5-colouring of planar graphs", SIAM Journal on Computing, 18 (2): 288–300, doi:10.1137/0218020, MR 0986668

Kainen, Paul C. (September 1974). "A Generalization of the 5-Color Theorem" (PDF). Proceedings of the American Mathematical Society. 45 (3): 450–452. doi:10.2307/2039977. JSTOR 2039977.

Lipton, Richard J.; Miller, Raymond E. (1978), "A batching method for coloring planar graphs", Information Processing Letters, 7 (4): 185–188, doi:10.1016/0020-0190(78)90065-0, MR 0497394
Chiba, Norishige; Nishizeki, Takao; Saito, Nobuji (1981), "A linear 5-coloring algorithm of planar graphs", Journal of Algorithms, 2 (4): 317–327, doi:10.1016/0196-6774(81)90031-6, MR 0640516
Frederickson, Greg N. (1984), "On linear-time algorithms for five-coloring planar graphs", Information Processing Letters, 19 (5): 219–224, CiteSeerX 10.1.1.158.5812, doi:10.1016/0020-0190(84)90056-5, MR 0777802
Williams, M. H. (1985), "A linear algorithm for colouring planar graphs with five colours", The Computer Journal, 28 (1): 78–81, doi:10.1093/comjnl/28.1.78, MR 0786929
Hagerup, Torben; Chrobak, Marek; Diks, Krzysztof (1989), "Optimal parallel 5-colouring of planar graphs", SIAM Journal on Computing, 18 (2): 288–300, doi:10.1137/0218020, MR 0986668
Kainen, Paul C. (September 1974). "A Generalization of the 5-Color Theorem" (PDF). Proceedings of the American Mathematical Society. 45 (3): 450–452. doi:10.2307/2039977. JSTOR 2039977.

Kainen, Paul C. (September 1974). "A Generalization of the 5-Color Theorem" (PDF). Proceedings of the American Mathematical Society. 45 (3): 450–452. doi:10.2307/2039977. JSTOR 2039977.

Frederickson, Greg N. (1984), "On linear-time algorithms for five-coloring planar graphs", Information Processing Letters, 19 (5): 219–224, CiteSeerX 10.1.1.158.5812, doi:10.1016/0020-0190(84)90056-5, MR 0777802

Matula, David; Shiloach, Yossi; Tarjan, Robert (November 1980), Two linear-time algorithms for five-coloring a planar graph (PDF), Tech. Report STAN-CS-80-830, Stanford University