On the Computation of the Competition Number of a Graph (Q4750663)
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 3807639
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Computation of the Competition Number of a Graph |
scientific article; zbMATH DE number 3807639 |
Statements
On the Computation of the Competition Number of a Graph (English)
0 references
1982
0 references
clique covering number
0 references
acyclic digraph
0 references
competition graph
0 references
competition number
0 references
