D()-vertex-distinguishing total coloring of graphs

DOI10.1007/S11425-006-2029-XMaRDI QIDQ867795zbMATHOpenAlexFDO

Authors Xiang'en Chen, Bing Yao, Wenjie Wang, Pengxiang Qiu, Zhongfu Zhang, Jingwen Li

Publication date 16 February 2007

Published in Science in China. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11425-006-2029-x

zbMATH Keywords

graphtotal coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\)
• \(D(\beta)\)-vertex-distinguishing proper total coloring of the generalized Mycielski graph \(M_n(P^3_m)\)
• 2-distance vertex-distinguishing total coloring of graphs
• Vertex-distinguishing total coloring of graphs
• General vertex-distinguishing total coloring of graphs

Cites work

• scientific article; zbMATH DE number 2185749 (Why is no real title available?)
• scientific article; zbMATH DE number 4085672 (Why is no real title available?)
• scientific article; zbMATH DE number 77956 (Why is no real title available?)
• scientific article; zbMATH DE number 169123 (Why is no real title available?)
• scientific article; zbMATH DE number 1390132 (Why is no real title available?)
• scientific article; zbMATH DE number 5174935 (Why is no real title available?)
• A note on adjacent strong edge coloring of \(K(n,m)\)
• Adjacent strong edge coloring of graphs
• Graph theory with applications
• On adjacent-vertex-distinguishing total coloring of graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• The complete chromatic number of some planar graphs
• Vertex-distinguishing edge colorings of graphs
• Vertex-distinguishing proper edge-colorings
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number

Cited in

(11)

• A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data
• Adjacent strong edge colorings and total colorings of regular graphs
• \(D(\beta)\)-vertex-distinguishing proper total coloring of the generalized Mycielski graph \(M_n(P^3_m)\)
• \(D (2)\)-vertex distinguishing general edge colorings of graphs
• scientific article; zbMATH DE number 5174935 (Why is no real title available?)
• Distant set distinguishing total colourings of graphs
• On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\)
• \(d\)-strong total colorings of graphs
• 2-distance vertex-distinguishing total coloring of graphs
• \(D (\beta)\)-vertex-distinguishing VI-total coloring and I-total coloring on Cartesian product graphs of some regular cyclic graphs
• On \(d_2\)-coloring of certain families of graphs

This page was built for publication: \(D(\beta)\)-vertex-distinguishing total coloring of graphs

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