On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689): 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.1016/j.disopt.2010.09.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052434346 / rank | |||
Normal rank | |||
Revision as of 00:12, 20 March 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
