Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle (Q1025926)

From MaRDI portal
Revision as of 03:11, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle
scientific article

    Statements

    Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle (English)
    0 references
    0 references
    0 references
    23 June 2009
    0 references
    0 references
    chromatic polynomial
    0 references
    chromatically unique graph
    0 references
    chromatically equivalent graph
    0 references
    relative-closed
    0 references
    0 references