Search results
Jump to navigation
Jump to search
- The followings are the two most important conjectures regarding the problem. These two conjectures are still open. People approach them by relax the requirement for the numbe ...4 KB (712 words) - 06:48, 11 December 2011
- [[Category:Conjectures]] ...2 KB (337 words) - 10:32, 20 June 2017
- 9 KB (1,088 words) - 18:04, 22 August 2017
- The followings are the two most important conjectures regarding the problem. These two conjectures are still open. People approach them by relax the requirement for the numbe ...27 KB (4,881 words) - 13:52, 31 July 2013
- The followings are the two most important conjectures regarding the problem. These two conjectures are still open. People approach them by relax the requirement for the numbe ...27 KB (4,881 words) - 07:04, 2 June 2014
- The followings are the two most important conjectures regarding the graph coloring problem. These two conjectures are still open. We will not solve them in this class, but we will approach ...29 KB (4,994 words) - 01:21, 29 August 2011
- [[Category:Conjectures]] ...15 KB (2,427 words) - 22:24, 16 August 2017