5 research outputs found
Note on terminal-pairability in complete grid graphs
We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel (1999) concerning the path-pairability of high-dimensional complete grid graphs. As an intriguing by-product of our result we significantly improve the estimate of the necessary maximum degree in path-pairable graphs, a question originally raised and studied by Faudree, Gyárfás, and Lehel (1999). © 2017 Elsevier B.V
Terminal-Pairability in Complete Bipartite Graphs
We investigate the terminal-pairibility 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
which still guarantees that the demand graph is
terminal-pairable in this setting. We also prove a sharp theorem on the maximum
number of edges such a demand graph can have.Comment: 8 pages, several typos correcte
Terminal-Pairability in Complete Bipartite Graph of Non-Bipartite Demands
We investigate the terminal-pairability problem in the case when the base
graph is a complete bipartite graph, and the demand graph is a (not necessarily
bipartite) multigraph on the same vertex set. In computer science, this problem
is known as the edge-disjoint paths problem. We improve the lower bound on the
maximum value of which still guarantees that the demand graph
has a realization in . We also solve the extremal problem on the
number of edges, i.e., we determine the maximum number of edges which
guarantees that a demand graph is realizable in .Comment: 15 pages, draws from arXiv:1702.0431