The $L(2,1)$-Labeling Problem on Graphs (Q4881295)
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(2,1)-Labeling Problem on Graphs |
scientific article; zbMATH DE number 894069
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The $L(2,1)$-Labeling Problem on Graphs |
scientific article; zbMATH DE number 894069 |
Statements
The $L(2,1)$-Labeling Problem on Graphs (English)
0 references
21 April 1997
0 references
labeling
0 references
cographs
0 references
polynomial time algorithm
0 references
trees
0 references
chordal graphs
0 references
0.889491081237793
0 references
0.8841990232467651
0 references
0.8799481391906738
0 references
0.8792321085929871
0 references
