On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs

zbMATH Open1289.05166MaRDI QIDQ2859640FDOQ2859640

Authors: Liqun Liu, Xiang'en Chen 

Publication date: 19 November 2013

Published in: Pure and Applied Mathematics (Search for Journal in Brave)

Recommendations

• An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs
• scientific article; zbMATH DE number 5847230
• An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
• scientific article; zbMATH DE number 5732458

zbMATH Keywords

upper boundadjacent vertex-distinguishing total chromatic numberadjacent vertex-distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (13)

• An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs
• An upper bound on the vertex-distinguishing IE-total chromatic number of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
• Title not available (Why is that?)
• A bound of the vertex-distinguishing total chromatic number of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
• Asymptotic behavior of the adjacent vertex distinguishing total coloring of graphs
• The bound of the vertex-distinguishing total chromatic number of regular graphs

This page was built for publication: On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs

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