The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial (Q2897206)

From MaRDI portal
Revision as of 11:20, 5 July 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
The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial
scientific article

    Statements

    The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial (English)
    0 references
    0 references
    0 references
    0 references
    10 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    connectivity
    0 references
    chromatic polynomial
    0 references
    chromatic zero
    0 references
    0 references