Graphs of maximum diameter

DOI10.1016/0012-365X(92)90047-JzbMath0755.05046OpenAlexW2081475880MaRDI QIDQ1193709

W. F. Smyth, Louis Caccetta

Publication date: 27 September 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90047-j

zbMATH Keywords

graph diameter\(K\)-connected graphs\(K\)-edge- connected graphs\(K\)-restrained graphs

Mathematics Subject Classification ID

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

Related Items (9)

On the maximum diameter of \(k\)-colorable graphs ⋮ Distances in graphs of girth 6 and generalised cages ⋮ A lower bound on the average size of a connected vertex set of a graph ⋮ Maximum diameter of 3‐ and 4‐colorable graphs ⋮ Path eccentricity of graphs ⋮ Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza ⋮ On size, order, diameter and edge-connectivity of graphs ⋮ Size of graphs and digraphs with given diameter and connectivity constraints ⋮ Randomized construction of complexes with large diameter

Cites Work

• On the diameter of a graph
• Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes
• Longest Simple Paths in Polyhedral Graphs
• Diameters in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs of maximum diameter