Adjacent vertex-distinguishing colorings of the semistrong product of graphs

DOI10.15960/J.CNKI.ISSN.1007-6093.2017.03.013zbMATH Open1399.05090MaRDI QIDQ3176058FDOQ3176058

Authors Shuangliang Tian, Xinfang Dong, Ruilin Liu 

Publication date 18 July 2018

zbMATH Keywords

treecomplete graphsemistrong productadjacent vertex-distinguishing chromatic numberadjacent vertex-distinguishing coloring

Mathematics Subject Classification ID

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

Recommendations

• Adjacent vertex-distinguishing proper edge-coloring of strong product of graphs
• Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs
• Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
• Adjacent vertex distinguishing total coloring of Cartesian product of graphs
• Relation between Cartesian product and adjacent vertex distinguishing coloring

Cited in

(5)

• Adjacent vertex-distinguishing proper edge-coloring of strong product of graphs
• scientific article; zbMATH DE number 6769480 (Why is no real title available?)
• scientific article; zbMATH DE number 6129768 (Why is no real title available?)
• scientific article; zbMATH DE number 5812811 (Why is no real title available?)
• scientific article; zbMATH DE number 6001818 (Why is no real title available?)

This page was built for publication: Adjacent vertex-distinguishing colorings of the semistrong product of graphs

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