Complexity of greedy edge-colouring
URL: https://inria.hal.science/hal-00762534
Dataset description:
The Grundy index of a graph G = (V,E) is the greatest number of colours that the greedy edge-colouring algorithm can use on G. We prove that the problem of determining the...
There are no views created for this resource yet.
Additional Information
| Field | Value |
|---|---|
| Data last updated | unknown |
| Metadata last updated | June 1, 2026 |
| Created | unknown |
| Format | HTML |
| License | https://about.hal.science/hal-authorisation-v1/, info:eu-repo/semantics/OpenAccess |
| Created | 5 months ago |
| Id | 54b710a2-1bdd-4999-b372-2697a96dadee |
| Package id | oai-hal-hal-00762534v1 |
| Resource type | HTML |
| State | active |