A Certifying Algorithm for 3-Colorability of P 5-Free Graphs (Q3652246)

From MaRDI portal
Revision as of 23:24, 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
A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
scientific article

    Statements

    A Certifying Algorithm for 3-Colorability of P 5-Free Graphs (English)
    0 references
    0 references
    0 references
    0 references
    17 December 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm
    0 references
    \(P_5\)-free graph
    0 references
    3-colorabilty
    0 references
    0 references