On the Computation of the Competition Number of a Graph (Q4750663)

From MaRDI portal
Revision as of 19:38, 9 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3807639
Language Label Description Also known as
English
On the Computation of the Competition Number of a Graph
scientific article; zbMATH DE number 3807639

    Statements

    On the Computation of the Competition Number of a Graph (English)
    0 references
    0 references
    1982
    0 references
    clique covering number
    0 references
    acyclic digraph
    0 references
    competition graph
    0 references
    competition number
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references