# zbMATH — the first resource for mathematics

First kind weak total chromatic numbers of graphs $$C_m\vee F_n$$, $$C_m\vee W_n$$ and $$C_m\vee C_n$$. (Chinese. English summary) Zbl 1313.05137
Summary: This paper provides programs about the colorings of cycles and fans, cycles and wheels, and cycles and cycles: (1) for $$C_m\vee F_n$$, $$\chi_{fwt}(C_m\vee F_n)=m+n+1$$, (2) for $$C_m\vee W_n$$, $$\chi_{fwt}(C_m\vee W_n)=m+n+1$$, (3) for $$C_m\vee C_n$$, $$\chi_{fwt}(C_m\vee C_n)=m+n$$. We also give the proof of these results.
##### MSC:
 05C15 Coloring of graphs and hypergraphs