A note on connected greedy edge colouring (Q2231754): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2021.07.018 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3189633232 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2012.13916 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2021.07.018 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:31, 17 December 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
    0 references
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references