On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116)

From MaRDI portal
Revision as of 07:39, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs
scientific article

    Statements

    On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (English)
    0 references
    4 April 2013
    0 references
    analysis of algorithms
    0 references
    combinatorial problems
    0 references
    graph algorithms
    0 references
    \(L(2,1)\)-labeling
    0 references
    list labeling
    0 references
    graph coloring model
    0 references
    exact algorithm
    0 references

    Identifiers

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