One upper bound on the D(2)-vertex-distinguishing chromatic numbers of graphs

zbMATH Open1199.05139MaRDI QIDQ3403632FDOQ3403632

Authors: Shuxun Wang, Jingjing Tian 

Publication date: 12 February 2010

Recommendations

• One the upper bound of the \(D\)(2)-vertex-distinguishing chromatic numbers of graphs
• An upper bound on the \(D\left ( \beta \right)\)-vertex-distinguishing edge chromatic number of graphs
• An upper bound for \(D\)(2)-vertex-distinguishing proper edge chromatic numbers of graphs
• Upper bounds on the \(D(\beta)\)-vertex-distinguishing total-chromatic number of graphs.
• An upper bound on the vertex-distinguishing IE-total chromatic number of graphs

zbMATH Keywords

graph\(D(2)\)-vertex-distinguishing proper edge-coloring\(D(2)\)-vertex-distinguishing proper edge-coloring chromatic numberweighted local lemma

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Cited In (6)

• A bound of the vertex-distinguishing total chromatic number of graphs
• Upper bounds on the \(D(\beta)\)-vertex-distinguishing total-chromatic number of graphs.
• One the upper bound of the \(D\)(2)-vertex-distinguishing chromatic numbers of graphs
• An upper bound on the \(D\left ( \beta \right)\)-vertex-distinguishing edge chromatic number of graphs
• An upper bound for \(D\)(2)-vertex-distinguishing proper edge chromatic numbers of graphs
• Upper bounds on vertex distinguishing chromatic indices of some Halin graphs

This page was built for publication: One upper bound on the \(D(2)\)-vertex-distinguishing chromatic numbers of graphs

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