An Algorithm for a Minimum Cover of a Graph (Q3271425): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| label / en | label / en | ||
An Algorithm for a Minimum Cover of a Graph | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2033599 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4250256305 / rank | |||
Normal rank | |||
| Property / title | |||
An Algorithm for a Minimum Cover of a Graph (English) | |||
| Property / title: An Algorithm for a Minimum Cover of a Graph (English) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algebraic Topological Methods for the Synthesis of Switching Systems. I / rank | |||
Normal rank | |||
Latest revision as of 19:10, 11 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Algorithm for a Minimum Cover of a Graph |
scientific article |
Statements
1959
0 references
topology
0 references
An Algorithm for a Minimum Cover of a Graph (English)
0 references
