Efficient algorithms for finding critical subgraphs (Q2467361)

From MaRDI portal
Revision as of 23:55, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Efficient algorithms for finding critical subgraphs
scientific article

    Statements

    title
    Efficient algorithms for finding critical subgraphs (English)
    0 references
    author
    Philippe Galinier
    0 references
    Alain Hertz
    0 references
    Christian Desrosiers
    0 references
    publication date
    21 January 2008
    0 references
    zbMATH Keywords
    graph coloring
    0 references
    chromatic number
    0 references
    critical subgraphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C35
    0 references
    05C15
    0 references
    zbMATH DE Number
    5228815
    0 references
    OpenAlex ID
    W2034904496
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2467361&oldid=32273846"
    Powered by MediaWiki