Search results
Jump to navigation
Jump to search
Page title matches
- The '''four color theorem''', sometimes known as the '''four color map theorem''' or '''Guthrie's pro |title= The Four Color Theorem22 KB (3,572 words) - 03:09, 8 March 2024
- #REDIRECT [[Four color theorem]]32 bytes (4 words) - 23:10, 18 April 2010
- 219 bytes (32 words) - 07:56, 19 April 2010
- 867 bytes (112 words) - 06:02, 21 April 2010
- 236 bytes (31 words) - 11:34, 19 April 2010
Page text matches
- #REDIRECT [[Four color theorem]]32 bytes (4 words) - 23:12, 18 April 2010
- #REDIRECT [[Four color theorem]]32 bytes (4 words) - 23:10, 18 April 2010
- #REDIRECT [[Four color theorem]]32 bytes (4 words) - 23:11, 18 April 2010
- #REDIRECT [[Four color theorem]]32 bytes (4 words) - 23:11, 18 April 2010
- #REDIRECT [[Four color theorem]]32 bytes (4 words) - 23:12, 18 April 2010
- 867 bytes (112 words) - 06:02, 21 April 2010
- ...974, although on planar graphs it's trivial for ''k'' ≠ 3 (due to the [[four color theorem]]). There are however some efficient approximation algorithms that employ [14 KB (2,315 words) - 00:35, 9 February 2010
- The '''four color theorem''', sometimes known as the '''four color map theorem''' or '''Guthrie's pro |title= The Four Color Theorem22 KB (3,572 words) - 03:09, 8 March 2024
- ...includes the long-standing [[Poincaré conjecture]] and the controversial [[four color theorem]], whose only proof, by computer, has never been verified by a human.30 KB (4,289 words) - 16:03, 20 January 2023