On the maximum diameter of \(k\)-colorable graphs

DOI10.37236/10382zbMath1473.05142arXiv2009.02611OpenAlexW3199725699MaRDI QIDQ820842

Inne Singgih, László A. Székely, Éva Czabarka

Publication date: 28 September 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.02611

zbMATH Keywords

diameterchromatic numberminimum degreeextremal problems in graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Linear programming (90C05) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (3)

Maximum diameter of 3‐ and 4‐colorable graphs ⋮ Diameter, edge-connectivity, and \(C_4\)-freeness ⋮ Acyclic, star, and injective colouring: bounding the diameter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diameter of 4-colourable graphs
• Graphs of maximum diameter
• Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza
• On the diameter of a graph
• Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes
• Flag algebras

This page was built for publication: On the maximum diameter of \(k\)-colorable graphs