Maximum diameter of 3‐ and 4‐colorable graphs

DOI10.1002/jgt.22869zbMath1522.05080arXiv2109.13887OpenAlexW3203014339WikidataQ114236118 ScholiaQ114236118MaRDI QIDQ6093149

Éva Czabarka, László A. Székely, Stephen J. Smith

Publication date: 6 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

diameterminimum degreelinear programming duality\(k\)-colorable

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the maximum diameter of \(k\)-colorable graphs
• Diameter of 4-colourable graphs
• Graphs of maximum diameter
• Radius, diameter, and minimum degree
• 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

This page was built for publication: Maximum diameter of 3‐ and 4‐colorable graphs