The \(L(3,2,1)\)-labeling problem on graphs (Q3540508)
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: The L(3,2,1)-labeling problem on graphs |
scientific article; zbMATH DE number 5372065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(L(3,2,1)\)-labeling problem on graphs |
scientific article; zbMATH DE number 5372065 |
Statements
24 November 2008
0 references
\(L(3,2,1)\)-labeling
0 references
vertex 3-coloring
0 references
3-chromatic number
0 references
0.9191072583198548
0 references
0.9078787565231324
0 references
0.9048107862472534
0 references
0.9010693430900574
0 references
