Even-hole-free graphs part II: Recognition algorithm (Q3150171)

From MaRDI portal
Revision as of 00:27, 21 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59904351, #quickstatements; #temporary_batch_1710976035288)
scientific article
Language Label Description Also known as
English
Even-hole-free graphs part II: Recognition algorithm
scientific article

    Statements

    title
    Even-hole-free graphs part II: Recognition algorithm (English)
    0 references
    author
    Michele Conforti
    0 references
    Cornuéjols, Gérard
    0 references
    Ajai Kapoor
    0 references
    Kristina Vušković
    0 references
    publication date
    29 September 2002
    0 references
    zbMATH Keywords
    even hole
    0 references
    decomposition
    0 references
    polytime algorithm
    0 references

    Identifiers

    DOI
    10.1002/jgt.10045
    0 references
    zbMATH DE Number
    1809247
    0 references
    OpenAlex ID
    W2528399963
    0 references
    Wikidata QID
    Q59904351
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3150171&oldid=33096862"
    Powered by MediaWiki