Incidence-adjacent vertex distinguishing total coloring and incidence-adjacent vertex distinguishing equitable total coloring of some graphs

zbMATH Open1463.05209MaRDI QIDQ3385751FDOQ3385751

Authors:

Publication date: 14 January 2021

Recommendations

• The incidence-adjacent vertex distinguishing equitable total coloring of graphs
• scientific article; zbMATH DE number 7339314
• Incidence-adjacent vertex distinguishing equitable total coloring of some Mycielski graphs
• Incidence-adjacent vertex distinguishing equitable total coloring of \({C_m} \vee {C_n}\) \((m \ne n)\)
• scientific article; zbMATH DE number 5812180

zbMATH Keywords

square graphjoin graphincidence-adjacent vertex distinguishing equitable total chromatic numberincidence-adjacent vertex distinguishing equitable total coloringincidence-adjacent vertex-distinguishing total chromatic numberincidence-adjacent vertex-distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Incidence-adjacent vertex distinguishing equitable I-total coloring of ladder graphs
• Incidence-adjacent vertex distinguishing equitable total coloring of some Mycielski graphs
• The incidence-adjacent vertex distinguishing equitable total coloring of graphs
• Incidence-adjacent vertex distinguishing equitable total coloring of \({C_m} \vee {C_n}\) \((m \ne n)\)

This page was built for publication: Incidence-adjacent vertex distinguishing total coloring and incidence-adjacent vertex distinguishing equitable total coloring of some graphs

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