Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.06.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2163111788 / rank | |||
Normal rank | |||
Revision as of 20:40, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weighted coloring on planar, bipartite and split graphs: Complexity and approximation |
scientific article |
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
