scientific article; zbMATH DE number 434691
From MaRDI portal
Publication:3139528
zbMATH Open0791.05058MaRDI QIDQ3139528FDOQ3139528
Authors: Ralph Faudree, András Gyárfás, Jeno Lehel 
Publication date: 22 June 1994
Title of this publication is not available (Why is that?)
Recommendations
Cited In (20)
- On the maximum diameter of path-pairable graphs
- Networks communicating for each pairing of terminals
- Note on the bisection width of cubic graphs
- The path-pairability number of product of stars
- An improved upper bound on the maximum degree of terminal-pairable complete graphs
- Title not available (Why is that?)
- On the maximum degree of path-pairable planar graphs
- On path-pairability of the finite grids
- A communication problem and directed triple systems
- Note on the diameter of path-pairable graphs
- Path-pairability of infinite planar grids
- Minimal 2-connected graphs satisfying the even cut condition
- The terminal-pairability problem in complete bipartite graphs
- Three-regular path pairable graphs
- Title not available (Why is that?)
- Note on terminal-pairability in complete grid graphs
- The minimum size of graphs satisfying cut conditions
- On path-pairability in the Cartesian product of graphs
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
- Finding Minors in Graphs with a Given Path Structure
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139528)
