A result on \(K\)-\((2,1)\)-total choosability of planar graphs (Q5081905)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7543997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A result on \(K\)-\((2,1)\)-total choosability of planar graphs |
scientific article; zbMATH DE number 7543997 |
Statements
17 June 2022
0 references
\(L\)-\((2,1)\)-total labeling
0 references
\(k\)-\((2,1)\)-total choosable
0 references
planar graphs
0 references
0 references
0.9110018610954284
0 references
0.857654333114624
0 references
0.8426566123962402
0 references
0.8404191136360168
0 references
