Vertex-distinguishing E-total coloring of complete bipartite graph \({K_{10,n}}\) with \( 91 \le n \le 214\). (Chinese. English summary) Zbl 1449.05091
Summary: Let \(\chi_{vt}^e (G) = \min\{{k\mid G\; {\mathrm{has\; a}}\; k\text{-VDET coloring}}\}\), then \(\chi_{vt}^e (G)\) is called the VDET chromatic number of \(G\). By using the analytical method and proof via contradiction, the VDET coloring of complete bipartite graph \({K_{10,n}}\) was discussed and the VDET chromatic number of \({K_{10,n}}\) \((91 \le n \le 214)\) was obtained.
MSC:
| 05C15 | Coloring of graphs and hypergraphs |
