Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218)

From MaRDI portal
Revision as of 11:05, 9 December 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128333959, #quickstatements; #temporary_batch_1733738735016)
scientific article
Language Label Description Also known as
English
Classifying \(k\)-edge colouring for \(H\)-free graphs
scientific article

    Statements

    Classifying \(k\)-edge colouring for \(H\)-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2019
    0 references
    edge-colouring
    0 references
    \(H\)-free graph
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers