A bound on the chromatic number of graphs without certain induced subgraphs (Q1150627)

From MaRDI portal
Revision as of 04:19, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A bound on the chromatic number of graphs without certain induced subgraphs
scientific article

    Statements

    A bound on the chromatic number of graphs without certain induced subgraphs (English)
    0 references
    0 references
    1980
    0 references
    complete subgraph
    0 references
    chromatic number
    0 references

    Identifiers