Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481)
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: Weighted coloring on planar, bipartite and split graphs: Complexity and approximation |
scientific article; zbMATH DE number 5572564
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weighted coloring on planar, bipartite and split graphs: Complexity and approximation |
scientific article; zbMATH DE number 5572564 |
Statements
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (English)
0 references
30 June 2009
0 references
graph coloring
0 references
weighted node coloring
0 references
weighted edge coloring
0 references
approximability
0 references
NP-completeness
0 references
planar graphs
0 references
bipartite graphs
0 references
split graphs
0 references
0 references
0.99456125497818
0 references
0.8327984809875488
0 references
0.829173743724823
0 references
