A lower bound for the chromatic capacity in terms of the chromatic number of a graph (Q390289)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A lower bound for the chromatic capacity in terms of the chromatic number of a graph
scientific article

    Statements

    A lower bound for the chromatic capacity in terms of the chromatic number of a graph (English)
    0 references
    0 references
    23 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    chromatic capacity
    0 references
    chromatic number
    0 references
    vertex colouring
    0 references
    edge colouring
    0 references
    0 references