D()-vertex-distinguishing total coloring of graphs

DOI10.1007/S11425-006-2029-XzbMATH Open1110.05039OpenAlexW2231031178MaRDI QIDQ867795FDOQ867795

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

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

zbMATH Keywords

graphtotal coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The complete chromatic number of some planar graphs
• Adjacent strong edge coloring of graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Graph theory with applications
• Vertex-distinguishing proper edge-colorings
• On the vertex-distinguishing proper edge-colorings of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Title not available (Why is that?)
• Vertex-distinguishing edge colorings of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on adjacent strong edge coloring of \(K(n,m)\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• 2-distance vertex-distinguishing total coloring of graphs
• Title not available (Why is that?)
• A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data
• \(D (2)\)-vertex distinguishing general edge colorings of graphs
• \(D (\beta)\)-vertex-distinguishing VI-total coloring and I-total coloring on Cartesian product graphs of some regular cyclic graphs
• \(d\)-strong total colorings of graphs
• 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)\)
• On \(d_2\)-coloring of certain families of graphs
• Distant set distinguishing total colourings of graphs
• On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\)

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)