On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:57, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph |
scientific article |
Statements
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (English)
0 references
20 June 2012
0 references
extremal graph theory
0 references
network upgrading
0 references
edge coloring
0 references
