Terminal-Pairability in Complete Graphs
From MaRDI portal
Publication:3119338
zbMath1415.05092arXiv1605.05857MaRDI QIDQ3119338
Tamás Róbert Mezei, Gábor Mészáros, Ervin Gyoeri
Publication date: 11 March 2019
Full work available at URL: https://arxiv.org/abs/1605.05857
Extremal problems in graph theory (05C35) Communication networks in operations research (90B18) Paths and cycles (05C38)
Related Items (5)
Minimal 2-connected graphs satisfying the even cut condition ⋮ The terminal-pairability problem in complete bipartite graphs ⋮ Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs ⋮ Note on the bisection width of cubic graphs ⋮ On path-pairability of the finite grids
This page was built for publication: Terminal-Pairability in Complete Graphs
