Polynomial algorithm for finding chromatic sum for unicyclic and outerplanar graphs. (Q5492583)
From MaRDI portal
!
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 5064033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial algorithm for finding chromatic sum for unicyclic and outerplanar graphs. |
scientific article; zbMATH DE number 5064033 |
Statements
16 October 2006
0 references
sum coloring
0 references
0.8068594336509705
0 references
0.8003816604614258
0 references
0.7983087301254272
0 references
0.7874576449394226
0 references
0.7865008115768433
0 references
