These graphs are $$f$$-choosable where $$f(v) = d(v) - 1$$ for each vertex $$v$$. So, none can be an induced subgraph of a minimal counterexample to the Borodin-Kostochka conjecture.