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

DOI10.1016/J.DISC.2018.06.005zbMath1392.05061arXiv1708.06837OpenAlexW2963732236WikidataQ129648484 ScholiaQ129648484MaRDI QIDQ724885

Gábor Mészáros, António Girão

Publication date: 26 July 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.06837

zbMATH Keywords

demand graphterminal-pairability

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Paths and cycles (05C38)

Related Items (1)

Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs

Cites Work

• Terminal-pairability in complete bipartite graphs
• Networks communicating for each pairing of terminals
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved upper bound on the maximum degree of terminal-pairable complete graphs