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

From MaRDI portal
Revision as of 13:10, 16 May 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    title
    An upper bound for the total chromatic number of dense graphs (English)
    0 references
    publication date
    27 September 1992
    0 references
    zbMATH Keywords
    upper bound
    0 references
    dense graphs
    0 references
    total chromatic number
    0 references
    cites work
    Q4198785
    0 references

    Identifiers

    zbMATH DE Number
    64301
    0 references
    OpenAlex ID
    W2000581481
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4013421&oldid=34091938"
    Powered by MediaWiki