An upper bound for the total chromatic number of dense graphs (Q4013421)

From MaRDI portal
Revision as of 19:19, 23 October 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
An upper bound for the total chromatic number of dense graphs
scientific article

    Statements

    An upper bound for the total chromatic number of dense graphs (English)
    0 references
    27 September 1992
    0 references
    upper bound
    0 references
    dense graphs
    0 references
    total chromatic number
    0 references

    Identifiers