search
Log In
0 votes
217 views

in Graph Theory
edited by
217 views
0
c option???
0
Yes C, G1 and G3 are bipartite.

There is a property mentioned by them.

"A bipartite graph doesn't have any odd length cycle" - Is that a valid property?
2

A graph is bipartite iff it has no odd-length cycle, we can prove also

0
Hmm, Thank You
0
Option c is Correct ???
0
Chromatic Number should be 2.
0
Yes @dilip

The question is not asking for chromatic number.

1 Answer

0 votes

Option is C (G1,G3) are bipartite 

1.Bipartite graph doesn have odd length cycle  

Related questions

3 votes
0 answers
1
0 votes
0 answers
2
...