Neighbor expanded sum distinguishing total coloring of some Mycielski graphs

MaRDI QIDQ5017083zbMATH OpenFDO

Authors Y. Y. Li, Jing Du

Publication date 17 December 2021

zbMATH Keywords

Mycielski graphneighbor expanded sum distinguishing total chromatic numberneighbor expanded sum distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• The neighbor expanded sum distinguishing total colorings of cactus graphs
• Neighbor expanded sum and distinguishing total coloring of three kinds of the product graphs of paths
• Neighbor expanded sum distinguishing total colorings of joins of two cycles, one path and one cycle and two paths
• Adjacent vertex-distinguishing E-total colorings on the Mycielski graph of some graphs
• The (Adjacent) Vertex-Distinguishing Total Coloring of the Mycielski Graphs and the Cartesian Product Graphs

Cited in

(5)

• An improved upper bound on neighbor expanded sum distinguishing index
• The neighbor expanded sum distinguishing total colorings of cactus graphs
• Neighbor expanded sum and distinguishing total coloring of three kinds of the product graphs of paths
• The neighbor expanded sum distinguishing index of Halin graphs.
• Neighbor expanded sum distinguishing total colorings of joins of two cycles, one path and one cycle and two paths

This page was built for publication: Neighbor expanded sum distinguishing 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 Q5017083)