A note on connected greedy edge colouring (Q2231754): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Connected Greedy Colourings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of Grundy coloring and its variants / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP completeness of finding the chromatic index of regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connected greedy coloring of \(H\)-free graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Results on the Grundy chromatic number of graphs / rank | |||
Normal rank |
Revision as of 17:45, 26 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on connected greedy edge colouring |
scientific article |
Statements
A note on connected greedy edge colouring (English)
0 references
30 September 2021
0 references
edge colouring
0 references
greedy colouring
0 references
connected greedy colouring
0 references
computational complexity
0 references
connected greedy edge colouring
0 references