A generalization of Opsut's lower bounds for the competition number of a graph (Q367054)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6211650
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A generalization of Opsut's lower bounds for the competition number of a graph |
scientific article; zbMATH DE number 6211650 |
Statements
A generalization of Opsut's lower bounds for the competition number of a graph (English)
0 references
26 September 2013
0 references
competition graph
0 references
competition number
0 references
vertex clique cover number
0 references
edge clique cover number
0 references
0 references
0.9441457
0 references
0 references
0.9040955
0 references
0.90022814
0 references
0.8901467
0 references
0.88743657
0 references
