The first kind weak total chromatic number of k-curb path (2 k 5)

zbMATH Open1240.05104MaRDI QIDQ3170416FDOQ3170416

Chengli Wang, Muchun Li, Fei Wen

Publication date: 29 September 2011

Recommendations

• The first kind weak total chromatic number of graph \(P_m\vee W_n\) and \(W_m\vee W_n\)
• scientific article; zbMATH DE number 5812570
• On a number of the first weak total coloring of direct product graph \({P_m} \bigwedge {S_n}\), \({P_m} \bigwedge {F_n}\) and \({P_m} \bigwedge {W_n}\)
• First kind weak total chromatic numbers of graphs \(C_m\vee F_n\), \(C_m\vee W_n\) and \(C_m\vee C_n\)
• Adjacent vertex-distinguishing E-total coloring on the multiple join graph of wheel and path

zbMATH Keywords

adjacent vertex-distinguishing edge total coloring\(k\)-curb graphthe first kind weak total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (1)

• First kind weak total chromatic numbers of graphs \(C_m\vee F_n\), \(C_m\vee W_n\) and \(C_m\vee C_n\)

This page was built for publication: The first kind weak total chromatic number of \(k\)-curb path (\(2 \leqslant k \leqslant 5\))

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170416)