Vertex-distinguishing E-total coloring of complete bipartite graph in which one part has 4 vertices. (Q5206414)
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 7144832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vertex-distinguishing E-total coloring of complete bipartite graph in which one part has 4 vertices. |
scientific article; zbMATH DE number 7144832 |
Statements
18 December 2019
0 references
complete bipartite graph
0 references
E-total coloring
0 references
vertex-distinguishing E-total coloring
0 references
vertex-distinguishing E-total chromatic number
0 references
0.9673197865486144
0 references
0.9611405730247498
0 references
0.9566496014595032
0 references
0.9503210186958312
0 references
