Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
scientific article

    Statements

    Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (English)
    0 references
    0 references
    0 references
    3 March 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    chromatic number
    0 references
    triangle-free graph
    0 references
    induced subgraph
    0 references
    forbidden subgraph
    0 references
    0 references