A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659)
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 sufficient condition for a tree to be (+1)-(2,1)-totally labelable |
scientific article; zbMATH DE number 6544347
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable |
scientific article; zbMATH DE number 6544347 |
Statements
A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (English)
0 references
23 February 2016
0 references
\((2,1)\)-total labeling
0 references
tree
0 references
maximum degree
0 references
0.9434080719947816
0 references
0.9356786608695984
0 references
0.9145815968513488
0 references
0.9136456847190856
0 references
0.8602718710899353
0 references
