On the maximum diameter of path-pairable graphs

DOI10.1007/s00373-019-02099-yzbMath1431.05056arXiv1707.04247OpenAlexW2972562256WikidataQ127253581 ScholiaQ127253581MaRDI QIDQ2287755

Kamil Popielarz, Gábor Mészáros, Richard Snyder, António Girão

Publication date: 21 January 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

diameterextremal graph theorypath-pairability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on the diameter of path-pairable graphs
• Note on terminal-pairability in complete grid graphs
• On path-pairability in the Cartesian product of graphs
• On the maximum degree of path-pairable planar graphs
• Highly linked graphs
• Networks communicating for each pairing of terminals

This page was built for publication: On the maximum diameter of path-pairable graphs