The complexity of an exotic edge coloring of graphs (Q5167097)
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: The complexity of an exotic edge coloring of graphs |
scientific article; zbMATH DE number 6315447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of an exotic edge coloring of graphs |
scientific article; zbMATH DE number 6315447 |
Statements
9 July 2014
0 references
maximal clique
0 references
maximum clique
0 references
\(k\)-clique
0 references
graph coloring
0 references
coloring the nodes
0 references
coloring the edges
0 references
NP-complete problems
0 references
0.8643917441368103
0 references
0.8058324456214905
0 references
0.7894229888916016
0 references
0.7633509039878845
0 references
