Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218)
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: Classifying k-edge colouring for H-free graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Classifying \(k\)-edge colouring for \(H\)-free graphs |
scientific article |
Statements
Classifying \(k\)-edge colouring for \(H\)-free graphs (English)
0 references
26 April 2019
0 references
edge-colouring
0 references
\(H\)-free graph
0 references
computational complexity
0 references
0 references
0.8432416319847107
0 references
0.8385721445083618
0 references
0.8385721445083618
0 references
0.8372085094451904
0 references
0.8262855410575867
0 references
