Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228)

From MaRDI portal
Revision as of 13:59, 23 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing the boxicity of a graph by covering its complement by cointerval graphs
scientific article

    Statements

    Computing the boxicity of a graph by covering its complement by cointerval graphs (English)
    0 references
    0 references
    0 references
    1983
    0 references

    Identifiers