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

From MaRDI portal
Revision as of 13:07, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
scientific article

    Statements

    title
    A Certifying Algorithm for 3-Colorability of P 5-Free Graphs (English)
    0 references
    author
    Daniel Bruce
    0 references
    Joe Sawada
    0 references
    Chính T. Hoàng
    0 references
    publication date
    17 December 2009
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    05C15
    0 references
    05C69
    0 references
    zbMATH DE Number
    5649412
    0 references
    zbMATH Keywords
    algorithm
    0 references
    \(P_5\)-free graph
    0 references
    3-colorabilty
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3652246&oldid=27942802"
    Powered by MediaWiki