Parity graphs are kernel-M-solvable (Q1121920)

From MaRDI portal
Revision as of 14:43, 19 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parity graphs are kernel-M-solvable
scientific article

    Statements

    title
    Parity graphs are kernel-M-solvable (English)
    0 references
    author
    Pierre Duchet
    0 references
    publication date
    1987
    0 references
    zbMATH Keywords
    orientation
    0 references
    parity graph
    0 references
    perfect graphs
    0 references
    cites work
    Q3203055
    0 references
    Q3222874
    0 references
    Graphes Noyau-Parfaits
    0 references
    Q5659563
    0 references

    Identifiers

    zbMATH DE Number
    4105018
    0 references
    OpenAlex ID
    W2084399079
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1121920&oldid=34803269"
    Powered by MediaWiki