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

From MaRDI portal
Revision as of 01:17, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
L(2,1,1)-Labeling Is NP-Complete for Trees
scientific article

    Statements

    title
    L(2,1,1)-Labeling Is NP-Complete for Trees (English)
    0 references
    author
    Petr A. Golovach
    0 references
    Bernard Lidický
    0 references
    Daniël Paulusma
    0 references
    publication date
    17 June 2010
    0 references
    Mathematics Subject Classification ID
    05C78
    0 references
    05C85
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5723182
    0 references
    OpenAlex ID
    W1588960957
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3569077&oldid=32556607"
    Powered by MediaWiki