Maximum chromatic polynomials of 2‐connected graphs (Q4297818)

From MaRDI portal
Revision as of 01:26, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 599617
Language Label Description Also known as
English
Maximum chromatic polynomials of 2‐connected graphs
scientific article; zbMATH DE number 599617

    Statements

    title
    Maximum chromatic polynomials of 2‐connected graphs (English)
    0 references
    author
    Ioan Tomescu
    0 references
    publication date
    20 March 1995
    0 references
    zbMATH DE Number
    599617
    0 references
    zbMATH Keywords
    2-connected graphs
    0 references
    chromatic polynomial
    0 references
    extremal graphs
    0 references
    cycles
    0 references
    OpenAlex ID
    W1995418109
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4297818&oldid=32588693"
    Powered by MediaWiki