Graph Theory Proof: "An undirected finite graph G is bipartite if and only if it contains no cycles of odd length"

Abstract

This document examines and proves the theorem, "an undirected finite graph G is bipartite if and only if it contains no cycles of odd length."

Author(s)

Caitlyn "Elise" Vigil-Cambron
Jennifer "Jen" Haigh
Shawn Bachlet
William "Max" Lees
Wyatt "Miller" Miller

 

Similar Projects