Suppose　that　G　is　a　planar　graph　with　maximum　degree　Delta.　In　this　paper　it　is　proved　that　G　is　total-(Delta　+　2)-choosable　if　(1)　Delta　a　parts　per　thousand　yen　7　and　G　has　no　adjacent　triangles　(i.e.,　no　two　triangles　are　incident　with　a　common　edge);　or　(2)　Delta　a　parts　per　thousand　yen　6　and　G　has　no　intersecting　triangles　(i.e.,　no　two　triangles　are　incident　with　a　common　vertex);　or　(3)　Delta　a　parts　per　thousand　yen　5,　G　has　no　adjacent　triangles　and　G　has　no　k-cycles　for　some　integer　k　a　{5,　6}.