Efficient algorithms for finding critical subgraphs (Q2467361)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Efficient algorithms for finding critical subgraphs
scientific article

    Statements

    Efficient algorithms for finding critical subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    graph coloring
    0 references
    chromatic number
    0 references
    critical subgraphs
    0 references
    0 references