0 votes 0 votes Graph Theory discrete-mathematics graph-theory gateforum-test-series graph-connectivity bipartite-graph + – Gupta731 asked Oct 29, 2018 • retagged Oct 9, 2023 by Hira Thakur Gupta731 802 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply akash.dinkar12 commented Oct 29, 2018 reply Follow Share c option??? 0 votes 0 votes Gupta731 commented Oct 29, 2018 reply Follow Share 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? 0 votes 0 votes akash.dinkar12 commented Oct 29, 2018 reply Follow Share A graph is bipartite iff it has no odd-length cycle, we can prove also 2 votes 2 votes Gupta731 commented Oct 29, 2018 reply Follow Share Hmm, Thank You 0 votes 0 votes kumar.dilip commented Oct 29, 2018 reply Follow Share Option c is Correct ??? 0 votes 0 votes kumar.dilip commented Oct 29, 2018 reply Follow Share Chromatic Number should be 2. 0 votes 0 votes Gupta731 commented Oct 29, 2018 reply Follow Share Yes @dilip The question is not asking for chromatic number. 0 votes 0 votes Hira Thakur commented Oct 9, 2023 reply Follow Share Condition for checking whether a graph is bipartite or not: A bipartite graph is 2 colorable means its chromatic number is $2$. A bipartite graph does not contain any odd-length cycle. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Option is C (G1,G3) are bipartite 1.Bipartite graph doesn have odd length cycle Vineet Pandey answered Sep 28, 2020 Vineet Pandey comment Share Follow See all 0 reply Please log in or register to add a comment.