On a number of the first weak total coloring of direct product graph P_m S_n, P_m F_n and P_m W_n

DOI10.3969/J.ISSN.1001-8395.2017.03.006zbMATH Open1389.05048MaRDI QIDQ3132035FDOQ3132035

Authors: Dazhou Wang, Shengzhi Zhang 

Publication date: 29 January 2018

Recommendations

• The first kind weak total chromatic number of graph \(P_m\vee W_n\) and \(W_m\vee W_n\)
• On total chromatic number of direct product graphs
• scientific article; zbMATH DE number 5812570
• First kind weak total chromatic numbers of graphs \(C_m\vee F_n\), \(C_m\vee W_n\) and \(C_m\vee C_n\)
• On total coloring the direct product of cycles and bipartite direct product of graphs

zbMATH Keywords

constructive methoddirect product graphfirst weak total chromatic numberfirst weak total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cited In (3)

• The first kind weak total chromatic number of graph \(P_m\vee W_n\) and \(W_m\vee W_n\)
• The first kind weak total chromatic number of \(k\)-curb path (\(2 \leqslant k \leqslant 5\))
• 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: 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}\)

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