Topics
Proofs
- Every tree is planar
- Every tree is a bipartite graph
- Every Bipartite Graph is Perfect
- Every bipartite graph is 2 chromatic
- Hypercube is Hamiltonian
- Hypercube is Bipartite
- Every tree is a bipartite graph
- A graph is bipartite if and only if it does not have a cycle of odd length
- A bipartite graph has a unique bipartition if and only if it is connected
- Petersen Graph is nonplanar
- Petersen Graph is not Hamiltonian
- Complete graph K4 is planar
