A bound of the vertex-distinguishing total chromatic number of graphs

MaRDI QIDQ2886306zbMATH OpenFDO

Authors Huiying Qiang

Publication date 1 June 2012

Published in Journal of Shandong University. Natural Science (Search for Journal in Brave)

zbMATH Keywords

vertex distinguishing total chromatic number[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=the+Lov%EF%BF%BD%EF%BF%BDsz+local+lemma&go=Go the Lov��sz local lemma]vertex-distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• The bound of the vertex-distinguishing total chromatic number of regular graphs
• An upper bound on the vertex-distinguishing IE-total chromatic number of graphs
• On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs
• scientific article; zbMATH DE number 5732458
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
• Upper bounds on the \(D(\beta)\)-vertex-distinguishing total-chromatic number of graphs.
• One upper bound on the \(D(2)\)-vertex-distinguishing chromatic numbers 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 on the \(D\left ( \beta \right)\)-vertex-distinguishing edge chromatic number of graphs

Cited in

(10)

• General vertex-distinguishing total coloring of graphs
• An upper bound on the vertex-distinguishing IE-total chromatic number of graphs
• scientific article; zbMATH DE number 5732458 (Why is no real title available?)
• A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
• Upper bounds on the \(D(\beta)\)-vertex-distinguishing total-chromatic number of graphs.
• An upper bound for \(D\)(2)-vertex-distinguishing proper edge chromatic numbers of graphs
• Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph
• Upper bounds on vertex distinguishing chromatic indices of some Halin graphs
• The bound of the vertex-distinguishing total chromatic number of regular graphs

This page was built for publication: A bound of the 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 Q2886306)