The following pages link to Graphs of maximum diameter (Q1193709):
Displaying 11 items.
- On size, order, diameter and edge-connectivity of graphs (Q682097) (← links)
- On the maximum diameter of \(k\)-colorable graphs (Q820842) (← links)
- Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza (Q1984510) (← links)
- Size of graphs and digraphs with given diameter and connectivity constraints (Q2043684) (← links)
- Randomized construction of complexes with large diameter (Q2046446) (← links)
- Distances in graphs of girth 6 and generalised cages (Q2656962) (← links)
- A lower bound on the average size of a connected vertex set of a graph (Q2664553) (← links)
- Maximum diameter of 3‐ and 4‐colorable graphs (Q6093149) (← links)
- Path eccentricity of graphs (Q6162021) (← links)
- Bounds on the fault-diameter of graphs (Q6496348) (← links)
- Minimum algebraic connectivity and maximum diameter: Aldous-Fill and Guiduli-Mohar conjectures (Q6500102) (← links)
