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

From MaRDI portal
Revision as of 22:03, 4 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    terminal-pairability
    0 references
    demand graph
    0 references

    Identifiers