Diameter of 4-colourable graphs
From MaRDI portal
Publication:1024307
DOI10.1016/J.EJC.2008.09.005zbMATH Open1198.05035OpenAlexW2013564047MaRDI QIDQ1024307FDOQ1024307
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
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)
Cites Work
Cited In (10)
- On the maximum diameter of \(k\)-colorable graphs
- Maximum diameter of 3‐ and 4‐colorable graphs
- A conjecture on average distance and diameter of a graph
- Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs
- Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza
- Diameter and maximum degree in Eulerian digraphs
- Distances in graphs of girth 6 and generalised cages
- 4-chromatic graphs with large odd girth
- Bounds on the fault-diameter of graphs
- Minimum degree, edge-connectivity and radius
Recommendations
- Maximum diameter of 3‐ and 4‐colorable graphs 👍 👎
- Diameter graphs in \({\mathbb R}^4\) 👍 👎
- Coloring Distance Graphs and Graphs of Diameters 👍 👎
- On the maximum diameter of \(k\)-colorable graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- A 4-colour problem for dense triangle-free graphs 👍 👎
- 4-chromatic graphs with large odd girth 👍 👎
- Quadrangulations and 4-color-critical graphs 👍 👎
- Colouring graphs of bounded diameter in the absence of small cycles 👍 👎
- Colouring graphs of bounded diameter in the absence of small cycles 👍 👎
This page was built for publication: Diameter of 4-colourable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024307)
