The absence of monochromatic triangle implies various properly colored spanning trees

Ruonan Li, Ruhui Lu, Xueli Su +1

An edge-colored graph $G$ is called properly colored if every two adjacent edges are assigned different colors. A monochromatic triangle is a cycle of length 3 with all the edges h…