Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{8,n}\) with \(8\le n\le 34\) (Q7001083)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8023415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{8,n}\) with \(8\le n\le 34\) |
scientific article; zbMATH DE number 8023415 |
Statements
Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{8,n}\) with \(8\le n\le 34\) (English)
0 references
7 April 2025
0 references
complete bipartite graphs
0 references
E-total coloring
0 references
vertex-distinguishing E-total coloring
0 references
vertex-distinguishing E-total chromatic number
0 references
