On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116)
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: On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs |
scientific article; zbMATH DE number 6150425
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs |
scientific article; zbMATH DE number 6150425 |
Statements
On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (English)
0 references
4 April 2013
0 references
analysis of algorithms
0 references
combinatorial problems
0 references
graph algorithms
0 references
\(L(2,1)\)-labeling
0 references
list labeling
0 references
graph coloring model
0 references
exact algorithm
0 references
