On the complexity of recognizing a class of perfectly orderable graphs (Q1917290)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of recognizing a class of perfectly orderable graphs
scientific article

    Statements

    On the complexity of recognizing a class of perfectly orderable graphs (English)
    0 references
    0 references
    7 July 1996
    0 references
    perfectly orderable graphs
    0 references

    Identifiers