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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C12 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6048256 / rank
 
Normal rank
Property / zbMATH Keywords
 
extremal graph theory
Property / zbMATH Keywords: extremal graph theory / rank
 
Normal rank
Property / zbMATH Keywords
 
network upgrading
Property / zbMATH Keywords: network upgrading / rank
 
Normal rank
Property / zbMATH Keywords
 
edge coloring
Property / zbMATH Keywords: edge coloring / rank
 
Normal rank

Revision as of 22:35, 29 June 2023

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
    extremal graph theory
    0 references
    network upgrading
    0 references
    edge coloring
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references