A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data

MaRDI QIDQ2885693zbMATH OpenFDO

Authors Huiying Qiang, Muchun Li, Zhongfu Zhang

Publication date 1 June 2012

Published in Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)

zbMATH Keywords

vertex-distinguishing-total coloringthe Lovász local Lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• \(D(\beta)\)-vertex-distinguishing total coloring of graphs
• A bound of the vertex-distinguishing total chromatic number of graphs
• The bound of the vertex-distinguishing total chromatic number of regular graphs
• Upper bounds on the \(D(\beta)\)-vertex-distinguishing total-chromatic number of graphs.
• \(D(\beta)\)-vertex-distinguishing proper total coloring of the generalized Mycielski graph \(M_n(P^3_m)\)

Cited in

(2)

• Distant set distinguishing total colourings of graphs
• \(d\)-strong total colorings of graphs

This page was built for publication: A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data

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