for 3 nodes
1
/
2 3
set1 set2
1 2
3
sir instead of having odd nodes it forms bipartite graph
sir is it exception?
because odd length graph are always not bipartite.
for 3 nodes
1
/
2 3
set1 set2
1 2
3
sir instead of having odd nodes it forms bipartite graph
sir is it exception?
because odd length graph are always not bipartite.
Yes the graph you gave is bipartite.
what are your thoughts on this graph with length 3?
1-2-3-4
well its bipartite!
Now the correct saying is:
t is obvious that if a graph has an odd length cycle then it cannot be Bipartite
hope you didn’t miss cycle.
you have reopen the doubt
anything you want to ask?
if not then Please mark it as resolved
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.