Problem 8.3: Bold Conjecture

Tadashi Sakuma, Department of Graphics and Computer Sciences, University of Tokyo, has found a 24 vertex uniquely 3-colorable counterexample to G. Bacsó's Bold Conjecture.

The ingenious example has been described in a manuscript titled "A Counterexample of the Bold Conjecture", which we received from the author in February 1996.

Tommy R. Jensen, April 25 1996.

The above mentioned paper has appeared:

T. Sakuma, A Counterexample to the Bold Conjecture, J. Graph Theory 25 (1997), 165-168.

Bjarne Toft, August 14 1997.

Back to Overview menu
Back to Graph Coloring Problems homepage

Last modified August 14, 1997 Bjarne Toft