The complexity of recognizing tough cubic graphs (Q1372728)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of recognizing tough cubic graphs
scientific article

    Statements

    The complexity of recognizing tough cubic graphs (English)
    0 references
    7 January 1998
    0 references
    0 references
    0 references
    0 references
    0 references
    cubic graphs
    0 references
    NP-completeness
    0 references
    tough graphs
    0 references
    0 references
    0 references
    0 references
    0 references