An upper bound of star-edge-star total chromatic number of graphs (Q4901280)
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: An upper bound of star-edge-star total chromatic number of graphs |
scientific article; zbMATH DE number 6129775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound of star-edge-star total chromatic number of graphs |
scientific article; zbMATH DE number 6129775 |
Statements
24 January 2013
0 references
star-edge-star total coloring
0 references
star-edge-star total chromatic number
0 references
probabilistic method
0 references
Lovász local lemma
0 references
0.8396703600883484
0 references
0.8373445272445679
0 references
0.8271183967590332
0 references
0.8271183967590332
0 references
0.8271130323410034
0 references
