scientific article
From MaRDI portal
Publication:3139528
zbMath0791.05058MaRDI QIDQ3139528
András Gyárfás, Jenő Lehel, Ralph J. Faudree
Publication date: 22 June 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
Minimal 2-connected graphs satisfying the even cut condition ⋮ The terminal-pairability problem in complete bipartite graphs ⋮ Networks communicating for each pairing of terminals ⋮ On the maximum degree of path-pairable planar graphs ⋮ A communication problem and directed triple systems ⋮ 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 ⋮ The minimum size of graphs satisfying cut conditions ⋮ Note on terminal-pairability in complete grid graphs ⋮ An improved upper bound on the maximum degree of terminal-pairable complete graphs ⋮ On path-pairability in the Cartesian product of graphs ⋮ On the maximum diameter of path-pairable graphs
This page was built for publication: