Three-regular path pairable graphs
From MaRDI portal
Recommendations
Cites work
- A sufficient condition for graphs to be weakly \(k\)-linked
- Networks communicating for each pairing of terminals
- On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- Parallelism in Comparison Problems
- Superconcentrators
Cited in
(13)- Three-regular parts of four-regular graphs
- scientific article; zbMATH DE number 2165735 (Why is no real title available?)
- Networks communicating for each pairing of terminals
- On k-pairable regular graphs
- Note on the bisection width of cubic graphs
- The path-pairability number of product of stars
- scientific article; zbMATH DE number 90343 (Why is no real title available?)
- Note on the diameter of path-pairable graphs
- A communication problem and directed triple systems
- Minimal 2-connected graphs satisfying the even cut condition
- scientific article; zbMATH DE number 434691 (Why is no real title available?)
- 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
This page was built for publication: Three-regular path pairable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1187948)
