The complexity of \(L(p, q)\)-edge-labelling (Q6090539)

From MaRDI portal
Revision as of 07:19, 27 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7767695
Language Label Description Also known as
English
The complexity of \(L(p, q)\)-edge-labelling
scientific article; zbMATH DE number 7767695

    Statements

    The complexity of \(L(p, q)\)-edge-labelling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2023
    0 references
    0 references
    \(L(p, q)\)-labeling
    0 references
    colouring
    0 references
    dichotomy
    0 references
    computational complexity
    0 references
    NP-hard
    0 references