E-Total Coloring of Complete Bipartite Graphs
\nIn this study, using the method of contradiction and the pre-assignment of chromatic sets, we discuss the E-total coloring of complete bipartite graphs K5,n (5≤n≤7 113) which are vertex-distinguished by multiple sets. The vertex-distinguishing E-total chromatic numbers of this kind of graph are determined. \n
Publication Details
- Journal
- Springer Link (Chiba Institute of Technology)
- Published
- 2024-11-20
- DOI
- https://doi.org/10.1051/wujns/2024295412/pdf
- Primary Topic
- Diverse Scientific and Economic Studies
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China