An improved upper bound on the maximum degree of terminal-pairable complete graphs (Q724885): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Terminal-pairability in complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks communicating for each pairing of terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4018554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243059 / rank
 
Normal rank

Latest revision as of 05:53, 16 July 2024

scientific article
Language Label Description Also known as
English
An improved upper bound on the maximum degree of terminal-pairable complete graphs
scientific article

    Statements

    An improved upper bound on the maximum degree of terminal-pairable complete graphs (English)
    0 references
    0 references
    0 references
    26 July 2018
    0 references
    0 references
    terminal-pairability
    0 references
    demand graph
    0 references
    0 references
    0 references