Le problème d'étoiles pour graphes est NP-complèt (Q1151755)

From MaRDI portal
Revision as of 10:46, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Le problème d'étoiles pour graphes est NP-complèt
scientific article

    Statements

    Le problème d'étoiles pour graphes est NP-complèt (English)
    0 references
    0 references
    1981
    0 references
    NP-complete
    0 references
    chromatic automorphism
    0 references
    vertex neighbourhood
    0 references
    star problem
    0 references

    Identifiers