Note on the diameter of path-pairable graphs

DOI10.1016/J.DISC.2014.08.011zbMath1301.05109arXiv1401.7931OpenAlexW2006007454MaRDI QIDQ465276

Gábor Mészáros

Publication date: 31 October 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.7931

zbMATH Keywords

graph diameterpath-pairable graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (5)

Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs ⋮ The minimum size of graphs satisfying cut conditions ⋮ On path-pairability of the finite grids ⋮ On path-pairability in the Cartesian product of graphs ⋮ On the maximum diameter of path-pairable graphs

Cites Work

• Three-regular path pairable graphs
• Networks communicating for each pairing of terminals
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on the diameter of path-pairable graphs