On the Computation of the Competition Number of a Graph (Q4750663): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0603043 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091556347 / rank | |||
Normal rank | |||
Revision as of 01:03, 20 March 2024
scientific article; zbMATH DE number 3807639
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
