Incidence-adjacent vertex distinguishing equitable total coloring of some Mycielski graphs

DOI10.7511/DLLGXB201805016zbMATH Open1424.05111MaRDI QIDQ5381500FDOQ5381500

Authors:

Publication date: 21 June 2019

Recommendations

• scientific article; zbMATH DE number 7339314
• 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
• On the adjacent vertex-distinguishing incidence coloring of general Mycielski graphs
• Adjacent vertex-distinguishing \(E\)-total colorings on the Mycielski graph of some graphs

zbMATH Keywords

Mycielski graphincidence-adjacent vertex distinguishing equitable total chromatic numberincidence-adjacent vertex distinguishing equitable total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Incidence-adjacent vertex distinguishing equitable I-total coloring of ladder graphs
• 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
• On the adjacent vertex-distinguishing incidence coloring of general Mycielski graphs
• On the equitable total chromatic number of two classes of Mycielski graphs and some special planar graphs

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

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