An upper bound for the competition numbers of graphs (Q968122): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 19:13, 30 January 2024

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