scientific article
From MaRDI portal
Publication:4018554
zbMATH Open0776.05058MaRDI QIDQ4018554FDOQ4018554
Publication date: 16 January 1993
Title of this publication is not available (Why is that?)
Recommendations
Cited In (16)
- On the maximum diameter of path-pairable graphs
- Linkage on the infinite grid
- Networks communicating for each pairing of terminals
- An improved upper bound on the maximum degree of terminal-pairable complete graphs
- Dual properties within graph theory
- Some properties of similar pairs
- On the maximum degree of path-pairable planar graphs
- On path-pairability of the finite grids
- Note on the diameter of path-pairable graphs
- Path-pairability of infinite planar grids
- 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
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 Q4018554)