Claims

../

1992_05_01_fleischner_stiebitz: Theorem 1.1 of Fleischner and Stiebitz's 1992 paper: a 4-regular graph on 3n vertices decomposing into a Hamiltonian circuit and n disjoint triangles has chromatic number 3; refereed, and credited as the solution by the site.

1993_01_01_sachs: Sachs's 1993 chapter proves that a cycle-plus-triangles graph has an odd number of color-class partitions into three independent sets, so it is 3-colorable; an independent elementary proof in an edited volume.

---