On the complexity of recognizing perfectly orderable graphs (Q918707)

From MaRDI portal
Revision as of 17:15, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
On the complexity of recognizing perfectly orderable graphs
scientific article

    Statements

    title
    On the complexity of recognizing perfectly orderable graphs (English)
    0 references
    author
    Matthias Middendorf
    0 references
    Frank Pfeiffer
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    perfectly orderable graphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    05C99
    0 references
    zbMATH DE Number
    4160136
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q918707&oldid=12884049"
    Powered by MediaWiki