L(2,1,1)-Labeling Is NP-Complete for Trees (Q3569077)

From MaRDI portal
scientific article
Language Label Description Also known as
English
L(2,1,1)-Labeling Is NP-Complete for Trees
scientific article

    Statements

    L(2,1,1)-Labeling Is NP-Complete for Trees (English)
    0 references
    0 references
    0 references
    0 references
    17 June 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references