Terminal-pairability in complete bipartite graphs
From MaRDI portal
Publication:1693175
DOI10.1016/j.dam.2017.10.026zbMath1377.05187arXiv1702.04313OpenAlexW2588426828MaRDI QIDQ1693175
Lucas Colucci, Tamás Róbert Mezei, Péter L. Erdős, Ervin Gyoeri
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.04313
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items (3)
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 ⋮ An improved upper bound on the maximum degree of terminal-pairable complete graphs
Cites Work
This page was built for publication: Terminal-pairability in complete bipartite graphs