An upper bound for the competition numbers of graphs (Q968122): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2009.09.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2009.09.007 / rank | |||
Normal rank | |||
Latest revision as of 10:25, 10 December 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
