scientific article; zbMATH DE number 5847230

MaRDI QIDQ3072236zbMATH OpenFDO

Authors Fugang Chao, Zhongfu Zhang, Huiying Qiang

Publication date 5 February 2011

Full work available at URL https://eudml.org/doc/49002

zbMATH Keywords

adjacent vertex distinguishing total chromatic numberadjacent vertex distinguishing total colouringLovász local lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 5732458
• On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
• An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
• An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs
• An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph
• An upper bound for the total chromatic number
• scientific article; zbMATH DE number 861441
• Bounds on the distinguishing chromatic number
• An upper bound of adjacent strong edge chromatic number

Cited in

(6)

• An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs
• Distinguishing graphs by total colourings
• scientific article; zbMATH DE number 5732458 (Why is no real title available?)
• On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs
• The bound of the vertex-distinguishing total chromatic number of regular graphs
• Not necessarily proper total colourings which are adjacent vertex distinguishing

This page was built for publication:

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