Given that a graph contains no odd cycle. Is it enough to tell that it is bipartite?
|Answer» A. yes|
|Explanation: it is required that the graph is connected also. if it is not then it cannot be called a bipartite graph.|
Login to Continue
It will take less than 2 minutes