This preview shows page 1. Sign up to view the full content.
Unformatted text preview: E connect some vertex in V 1 with some vertex in V 2 .) (a) Prove that a bipartite graph has no cycle of odd length. (b) Design an algorithm based on breadth-ﬁrst search (BFS) to determine if an undi-rected graph G is bipartite. (c) Fully justify the correctness of your algorithm. 1...
View Full Document
This note was uploaded on 12/09/2010 for the course ENGLISH 1303 taught by Professor May during the Spring '10 term at HKU.
- Spring '10