\(D(\beta)\)-vertex-distinguishing total coloring of graphs
From MaRDI portal
Publication:867795
DOI10.1007/s11425-006-2029-xzbMath1110.05039OpenAlexW2231031178MaRDI QIDQ867795
Xiang'en Chen, Bing Yao, Pengxiang Qiu, Wenjie Wang, Jing-wen Li, Zhong Fu Zhang
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
Related Items
Distant set distinguishing total colourings of graphs, On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\), Adjacent strong edge colorings and total colorings of regular graphs, \(d\)-strong total colorings of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the vertex-distinguishing proper edge-colorings of graphs
- The complete chromatic number of some planar graphs
- Adjacent strong edge coloring of graphs
- A note on adjacent strong edge coloring of \(K(n,m)\)
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- On adjacent-vertex-distinguishing total coloring of graphs
- Vertex-distinguishing proper edge-colorings
- Vertex-distinguishing edge colorings of graphs