Upper bounds on the D()-vertex-distinguishing total-chromatic number of graphs.

MaRDI QIDQ2804813zbMATHFDO

Authors Xinsheng Liu, Zhi-Qiang Zhu

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

positive probabilityrandom coloringprobability method\(D(\beta)\)-vertex-distinguishing total-chromatic number

Mathematics Subject Classification ID

Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)

Recommendations

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

Cited in

(7)

• A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data
• An upper bound on the \(D\left ( \beta \right)\)-vertex-distinguishing edge chromatic number of graphs
• One the upper bound of the \(D\)(2)-vertex-distinguishing chromatic numbers of graphs
• An upper bound for \(D\)(2)-vertex-distinguishing proper edge chromatic numbers of graphs
• One upper bound on the \(D(2)\)-vertex-distinguishing chromatic numbers of graphs
• An upper bound on the vertex-distinguishing IE-total chromatic number of graphs
• A bound of the vertex-distinguishing total chromatic number of graphs

This page was built for publication: Upper bounds on the \(D(\beta)\)-vertex-distinguishing total-chromatic number of graphs.

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