On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689)

From MaRDI portal
Revision as of 01:12, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references
    0 references
    20 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    extremal graph theory
    0 references
    network upgrading
    0 references
    edge coloring
    0 references
    0 references