New lower bounds on the weighted chromatic number of a graph (Q4669427)
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: New lower bounds on the weighted chromatic number of a graph |
scientific article; zbMATH DE number 2156842
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New lower bounds on the weighted chromatic number of a graph |
scientific article; zbMATH DE number 2156842 |
Statements
New lower bounds on the weighted chromatic number of a graph (English)
0 references
15 April 2005
0 references
coloring
0 references
algorithms
0 references
combinatorial analysis
0 references
weighted clique
0 references
NP-completeness
0 references