[Solved] A graph is found to be 2 colorable. What can be said about that graph?

Computer Science Engineering (CSE)
Design and Analysis of Algorithms
A graph is found to be 2 colorable. What...

Q.	A graph is found to be 2 colorable. What can be said about that graph?
A.	the given graph is eulerian
B.	the given graph is bipartite
C.	the given graph is hamiltonian
D.	the given graph is planar
Answer» B. the given graph is bipartite
Explanation: a graph is said to be colorable if two vertices connected by an edge are never of the same color. 2 colorable mean that this can be achieved with just 2 colors.

View all MCQs in: Design and Analysis of Algorithms

Discussion

Related Questions

A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
For a graph of degree three, in what time can a Hamiltonian path be found?
Consider a complete graph G with 4 vertices. The graph G has spanning trees.
Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.
Consider the graph shown below. Which of the following are the edges in the MST of the given graph?
What is the chromatic number of compliment of line graph of bipartite graph?
What is the clique size of the line graph of bipartite graph?
Every Perfect graph has forbidden graph characterization.