Talk:Graph is Bipartite iff No Odd Cycles

This proof is only correct for undirected graphs (we can reverese the shortest path from $a_1$ to $v$). Tomer T 09:44, 10 April 2012 (EDT)