\(d\)-strong total colorings of graphs (Q2346331)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: d-strong total colorings of graphs |
scientific article; zbMATH DE number 6441690
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(d\)-strong total colorings of graphs |
scientific article; zbMATH DE number 6441690 |
Statements
\(d\)-strong total colorings of graphs (English)
0 references
1 June 2015
0 references
strong total coloring
0 references
strong total chromatic number
0 references
vertex distinguishing total coloring
0 references
vertex distinguishing total chromatic number
0 references
cycle
0 references
path
0 references
circulant graph
0 references
0 references
0 references
0 references
0.9494423270225524
0 references
0.9471377730369568
0 references
0.8920975923538208
0 references
0.8490596413612366
0 references
