Given a graph G = (V,E), an even kernel is a nonempty independent subset V ′ ⊆ V , such that every vertex of G is adjacent to an even number (possibly 0) of vertices in V ′. It is proved that the question of whether a graph has an even kernel is NP-complete. The motivation stems from combinatorial game theory. It is known that this question is polynomial if G is bipartite. We also prove that th...