Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza

DOI10.1016/j.jctb.2021.06.001zbMath1479.05168OpenAlexW3169215024MaRDI QIDQ1984510

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

Publication date: 16 September 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2021.06.001

zbMATH Keywords

diameterminimum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)

Related Items (3)

On the maximum diameter of \(k\)-colorable graphs ⋮ Maximum diameter of 3‐ and 4‐colorable graphs ⋮ Diameter, edge-connectivity, and \(C_4\)-freeness

Cites Work

• Unnamed Item
• Unnamed Item
• Diameter of 4-colourable graphs
• Graphs of maximum diameter
• 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: Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza