The　total　chromatic　number　of　a　graph　G,　denoted　by　χ″(G),　is　the　minimum　number　of　colors　needed　to　color　the　vertices　and　edges　of　G　such　that　no　two　adjacent　or　incident　elements　get　the　same　color.　It　is　known　that　if　a　planar　graph　G　has　maximum　degree　Δ＜9,　then　χ″(G)=Δ+1.　In　this　paper,　we　prove　that　if　G　is　a　planar　graph　with　maximum　degree　7,　and　for　every　vertex　v,　there　is　an　integer　kv∈3,4,5,6　so　that　v　is　not　incident　with　any　kv-cycle,　then　χ″(G)=8.　©　2011　Elsevier　B.V.　All　rights　reserved.