The Gateway to Computer Science Excellence
0 votes
95 views

in Graph Theory by Active (4.7k points)
edited by | 95 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.

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,648 questions
56,429 answers
195,217 comments
99,947 users