An upper bound for the competition numbers of graphs (Q968122)

From MaRDI portal
Revision as of 01:46, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
An upper bound for the competition numbers of graphs
scientific article

    Statements

    An upper bound for the competition numbers of graphs (English)
    0 references
    0 references
    5 May 2010
    0 references
    competition graph
    0 references
    competition number
    0 references
    chordal graph
    0 references
    hole
    0 references

    Identifiers