The　Borodin-Kostochka　conjecture　says　that　for　a　connected　graph　G,　if　Delta(G)　＞=　9,　then　chi(G)　＜=　max{Delta(G)　-　1,　omega(G)}.　In　this　paper,　we　prove　that　the　conjecture　holds　for　hammer-free　graphs,　where　a　hammer　is　the　graph　obtained　by　identifying　one　vertex　of　a　triangle　and　one　end　vertex　of　an　induced　path　with　three　vertices.　(c)　2023　Elsevier　B.V.　All　rights　reserved.