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

From MaRDI portal
Revision as of 18:44, 1 July 2023 by Importer (talk | contribs) (‎Changed an Item)
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
    intersection graph
    0 references
    interval graph
    0 references
    boxicity
    0 references
    edge coverings
    0 references

    Identifiers