Embedding and NP-completeness theorems for set-graceful, topologically set-graceful and set-sequential graphs (Q3400287)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Embedding and NP-completeness theorems for set-graceful, topologically set-graceful and set-sequential graphs
scientific article

    Statements

    Embedding and NP-completeness theorems for set-graceful, topologically set-graceful and set-sequential graphs (English)
    0 references
    0 references
    0 references
    0 references
    5 February 2010
    0 references
    harmonious graph
    0 references
    elegant graph
    0 references
    felicitous graph
    0 references
    cordial graph
    0 references
    oddgraceful graph
    0 references
    polychrome graph
    0 references
    strongly \(c\)-harmonious graph
    0 references
    0 references
    0 references

    Identifiers

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