On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disopt.2010.09.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISOPT.2010.09.008 / rank | |||
Normal rank | |||
Revision as of 01:30, 9 December 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
0 references
