Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{3,n}\) with \(n\geq 18\) (Q2824286)
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 6634896
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{3,n}\) with \(n\geq 18\) |
scientific article; zbMATH DE number 6634896 |
Statements
6 October 2016
0 references
complete bipartite graphs
0 references
vertex-distinguishing E-total coloring
0 references
vertex-distinguishing E-total chromatic number
0 references
Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{3,n}\) with \(n\geq 18\) (English)
0 references
0.9822987914085388
0 references
0.9733858704566956
0 references
0.97257399559021
0 references
0.9673197865486144
0 references
