Proof of Toft s Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable

Wenan Zang. Proof of Toft s Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable. J. Comb. Optim., 2(2):117-188, 1998.

Abstract

Abstract is missing.