Adjacent strong edge colorings and total colorings of regular graphs
From MaRDI portal
Publication:1041555
DOI10.1007/s11425-008-0153-5zbMath1190.05075OpenAlexW1983290845MaRDI QIDQ1041555
Liang Bian, Bing Yao, Douglas R. Woodall, Jing-wen Li, Xiang'en Chen, Zhong Fu Zhang
Publication date: 2 December 2009
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-008-0153-5
total chromatic numbertotal coloringadjacent strong edge coloringadjacent strong edge chromatic number
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs
- On the adjacent-vertex-strongly-distinguishing total coloring of graphs
- The complete chromatic number of some planar graphs
- Adjacent strong edge coloring of graphs
- On the total coloring of certain graphs
- On adjacent-vertex-distinguishing total coloring of graphs
- Nombre Chromatique Total Du Graphe R -Parti Complet
- Adjacent Vertex Distinguishing Edge‐Colorings
- The connectivity of total graphs
- On Total Chromatic Number of a Graph