On sum coloring of graphs (Q1811069)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 1925252
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On sum coloring of graphs |
scientific article; zbMATH DE number 1925252 |
Statements
On sum coloring of graphs (English)
0 references
10 June 2003
0 references
chromatic sum
0 references
optimaum cost chromatic partition
0 references
NP-complete
0 references
vertex strength
0 references
edge sum coloring
0 references
edge strength
0 references
optimum coloring
0 references
polynomial time algorithm
0 references
0.8814972043037415
0 references
0.8697647452354431
0 references
0.8668878078460693
0 references
0.8667201995849609
0 references
0.8663212060928345
0 references
