Almost all k-colorable graphs are easy to color (Q3811723)

From MaRDI portal
Revision as of 18:21, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Almost all k-colorable graphs are easy to color
scientific article

    Statements

    Almost all k-colorable graphs are easy to color (English)
    0 references
    1988
    0 references
    random graph
    0 references
    k-colorable graphs
    0 references
    Brelaz' algorithm
    0 references
    0 references

    Identifiers