On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles

Recently, Kowalik, Sereni, and Škrekovski proved that planar graphs with maximum degree 9 are 10-totally colorable. This work proves that planar graphs with maximum degree 8 and without intersecting triangles are 9-totally colorable.