Coloring edges and vertices of graphs without short or long cycles (Q3558598)
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 5704197
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring edges and vertices of graphs without short or long cycles |
scientific article; zbMATH DE number 5704197 |
Statements
5 May 2010
0 references
vertex coloring
0 references
edge coloring
0 references
NP-hard
0 references
polynomial time
0 references
0.8168275952339172
0 references
0.8109280467033386
0 references
0.7973929643630981
0 references
0.7930041551589966
0 references
0.7830576300621033
0 references
