P
Initializing...
Theorem 5.21 — a graph is 2-colorable iff it contains no odd cycle · Prove2Me