A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-014-9794-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W252958960 / rank | |||
Normal rank | |||
Revision as of 20:24, 19 March 2024
scientific article; zbMATH DE number 6544347
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
