Each picture shows an orientation of the given graph where every vertex has in-degree at least 2 and differing numbers of even and odd spanning eulerian subgraphs. So, these graphs cannot be induced subgraphs of a minimal counterexample to the Borodin-Kostochka conjecture (for Alon-Tarsi-number). The vertices are labeled with their in-degree.