A note on two problems in connexion with graphs (Q78129): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/BF01386390 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q21694527 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximal Flow Through a Network / rank | |||
Normal rank | |||
Latest revision as of 19:06, 11 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on two problems in connexion with graphs |
scientific article |
Statements
1
0 references
1
0 references
269-271
0 references
December 1959
0 references
1959
0 references
A note on two problems in connexion with graphs (English)
0 references
topology
0 references
