A. Apartsin

Learn More
We construct a directed graph G such that a) G is strongly connected, b) G has the circular symmetry, c) G is not a directed odd cycle, d) G has no kernel but e) after removing any edge from G the obtained graph has a kernel. 1The third author gratefully acknoledges the support of DIMACS, AFOSR (Grant F49620-93-1-0041) and ONR (Grants N0014-92-J-1375 and(More)
  • 1