Terminal-pairability in complete bipartite graphs

  title={Terminal-pairability in complete bipartite graphs},
  author={L. Colucci and P. Erd{\"o}s and E. Gy{\"o}ri and T. Mezei},
  journal={Discret. Appl. Math.},
  • L. Colucci, P. Erdös, +1 author T. Mezei
  • Published 2018
  • Mathematics, Computer Science
  • Discret. Appl. Math.
  • Abstract We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is also bipartite with the same color classes. We improve the lower bound on maximum value of Δ ( D ) which still guarantees that the demand graph D is terminal-pairable in this setting. We also prove a sharp theorem on the maximum number of edges such a demand graph can have. 
    1 Citations


    Note on terminal-pairability in complete grid graphs
    • 8
    • PDF
    A Communication Problem and Directed Triple Systems
    • 5
    • PDF
    A sufficient condition for graphs to be weaklyk-linked
    • A. Huck
    • Mathematics, Computer Science
    • Graphs Comb.
    • 1991
    • 20
    Networks communicating for each pairing of terminals
    • 22
    The chromatic class of a multigraph
    • 155
    A sufficient condition for graphs to be weakly k-linked, Graphs Combin
    • 1991
    Graph Theory, fourth ed
    • in: Graduate Texts in Mathematics,
    • 2010
    Graph theory, Fourth Edition
    • Graduate Texts in Mathematics,
    • 2010