An upper bound for the competition numbers of graphs (Q968122): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The competition number of a graph having exactly one hole / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3114944 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The competition number of a graph with exactly \(h\) holes, all of which are independent / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Computation of the Competition Number of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4171826 / rank | |||
Normal rank |
Revision as of 18:41, 2 July 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
5 May 2010
0 references
competition graph
0 references
competition number
0 references
chordal graph
0 references
hole
0 references
0 references