Diameter of 4-colourable graphs

DOI10.1016/j.ejc.2008.09.005zbMath1198.05035OpenAlexW2013564047MaRDI QIDQ1024307

Peter Dankelmann, László A. Székely, Éva Czabarka

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.09.005

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (8)

On the maximum diameter of \(k\)-colorable graphs ⋮ A CONJECTURE ON AVERAGE DISTANCE AND DIAMETER OF A GRAPH ⋮ Distances in graphs of girth 6 and generalised cages ⋮ Minimum degree, edge-connectivity and radius ⋮ Maximum diameter of 3‐ and 4‐colorable graphs ⋮ Diameter and maximum degree in Eulerian digraphs ⋮ Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza ⋮ Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs

Cites Work

• On the diameter of a graph
• Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Diameter of 4-colourable graphs