scientific article; zbMATH DE number 7339314

MaRDI QIDQ4985891zbMATH OpenFDO

Authors Jishun Wang, Lin Zuo, Renfu Ge

Publication date 26 April 2021

zbMATH Keywords

incidence-adjacent vertex distinguishing equitable total chromatic numberincidence-adjacent vertex distinguishing equitable total coloringMycielski graphpower graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Incidence-adjacent vertex distinguishing equitable total coloring of \({C_m} \vee {C_n}\) \((m \ne n)\)
• Incidence-adjacent vertex distinguishing total coloring and incidence-adjacent vertex distinguishing equitable total coloring of some graphs
• The incidence-adjacent vertex distinguishing equitable total coloring of graphs
• Incidence-adjacent vertex distinguishing equitable total coloring of some Mycielski graphs
• Adjacent vertex-distinguishing I-total colorings of P_n C_m
• scientific article; zbMATH DE number 5140854
• scientific article; zbMATH DE number 6613041
• Adjacent vertex-distinguishing \(I\)-total coloring of \(C_n^2\)
• scientific article; zbMATH DE number 5120880
• Adjacent vertex-distinguishing I-total coloring of graphs M(C_n) and M(W_n)

Cited in

(6)

• The incidence-adjacent vertex distinguishing equitable total coloring of graphs
• Incidence-adjacent vertex distinguishing total coloring and incidence-adjacent vertex distinguishing equitable total coloring of some graphs
• Incidence-adjacent vertex distinguishing equitable I-total coloring of ladder graphs
• Incidence-adjacent vertex distinguishing equitable total coloring of \({C_m} \vee {C_n}\) \((m \ne n)\)
• On the adjacent vertex-distinguishing incidence coloring of general Mycielski graphs
• Incidence-adjacent vertex distinguishing equitable total coloring of some Mycielski graphs

This page was built for publication:

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