NP-hardness of the recognition of coordinated graphs (Q839773)

From MaRDI portal
scientific article
Language Label Description Also known as
English
NP-hardness of the recognition of coordinated graphs
scientific article

    Statements

    NP-hardness of the recognition of coordinated graphs (English)
    0 references
    0 references
    0 references
    3 September 2009
    0 references
    computational complexity
    0 references
    coordinated graph recognition
    0 references
    \(\{\)gem
    0 references
    C\(_{4}\), odd hole\(\}\)-free graphs
    0 references
    NP-complete problems
    0 references

    Identifiers

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