Complexity of the improper twin edge coloring of graphs (Q2409501)
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: Complexity of the improper twin edge coloring of graphs |
scientific article; zbMATH DE number 6789888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the improper twin edge coloring of graphs |
scientific article; zbMATH DE number 6789888 |
Statements
Complexity of the improper twin edge coloring of graphs (English)
0 references
11 October 2017
0 references
modular chromatic index
0 references
twin edge/vertex coloring
0 references
odd/even color classes
0 references
NP-hardness
0 references
0.8222162127494812
0 references
0.8022602796554565
0 references
0.7960706353187561
0 references
0.7848677039146423
0 references
