Year: 2024
Type: article
Abstract: \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
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Award: 图的与未必正常全染色相关的参数研究
OpenAlex ID: W6921846434
FWCI:
Cites:
Cited by:
Related to: