A kernel in a directed graph is a set of vertices of such that no two vertices in are adjacent and for every vertex in , there is a vertex in such that is an arc of . The problem of existence of a kernel is NP-complete for a general digraph. In this paper, we introduce the acyclic kernel problem for an undirected graph and solve it in polynomial time for certain cycle-related graphs.