On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph |
scientific article; zbMATH DE number 6048256
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph |
scientific article; zbMATH DE number 6048256 |
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
0.7521572113037109
0 references
0.7521572113037109
0 references
0.7437934279441833
0 references
