An upper bound for the competition numbers of graphs (Q968122)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An upper bound for the competition numbers of graphs |
scientific article; zbMATH DE number 5703716
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for the competition numbers of graphs |
scientific article; zbMATH DE number 5703716 |
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
0.9711929559707642
0 references
0.8905790448188782
0 references
0.8760622143745422
0 references
0.8611499667167664
0 references
0.8534694910049438
0 references
