The $L(2,1)$-Labeling Problem on Graphs (Q4881295): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0895480193245339 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085421834 / rank | |||
Normal rank | |||
Latest revision as of 10:16, 30 July 2024
scientific article; zbMATH DE number 894069
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
