The following pages link to Diameter of 4-colourable graphs (Q1024307):
Displaying 10 items.
- Minimum degree, edge-connectivity and radius (Q385477) (← links)
- On the maximum diameter of \(k\)-colorable graphs (Q820842) (← links)
- Diameter and maximum degree in Eulerian digraphs (Q906483) (← links)
- 4-chromatic graphs with large odd girth (Q1842185) (← links)
- Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza (Q1984510) (← links)
- Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs (Q2334045) (← links)
- Distances in graphs of girth 6 and generalised cages (Q2656962) (← links)
- A conjecture on average distance and diameter of a graph (Q2890990) (← links)
- Maximum diameter of 3‐ and 4‐colorable graphs (Q6093149) (← links)
- Bounds on the fault-diameter of graphs (Q6496348) (← links)