Answers are grounded in this paper and cite their sources.
We prove the Borodin--Kostochka conjecture for (diamond,L₄)-free graphs and (diamond,K₅⁺)-free graphs, where L₄ is obtained from K₄ by attaching a path of length two to one clique vertex, and K₅⁺ is obtained from K₅ by adding a vertex adjacent to exactly one clique vertex. The proof uses structural properties of maximum cliques in diamond-free vertex-critical graphs with $χ=Δ$.
No takes yet. Share an insight, caveat, or question.
Alireza Fiujlaali (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: