Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable Wenan Zang OriginalPaper Pages: 117 - 188
