2 papers
math.CO2017
An improved upper bound on the maximum degree of terminal-pairable complete graphs
António Girão, Gábor Mészáros
A graph is terminal-pairable with respect to a demand multigraph on the same vertex set as , if there exists edge-disjoint paths joining the end vertices of every demand…
math.CO2017
On the maximum diameter of path-pairable graphs
Antonio Girao, Gabor Meszaros, Kamil Popielarz +1
A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diamet…