A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data (Q2885693)
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: A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data |
scientific article; zbMATH DE number 6040601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data |
scientific article; zbMATH DE number 6040601 |
Statements
1 June 2012
0 references
vertex-distinguishing-total coloring
0 references
the Lovász local Lemma
0 references
A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data (English)
0 references
0.8588802218437195
0 references
0.8465797305107117
0 references
0.8333478569984436
0 references
0.8256849050521851
0 references
