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

From MaRDI portal
Revision as of 00:36, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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