0 votes 0 votes If a 2 regular graph G has a perfect matching, then which of the following is NOT true? 1. G is a cycle graph 2. Chromatic number of G is 2 3. Every component of G is even cycle 4. G is a bipartite graph Chaitrasj asked Jan 16, 2019 Chaitrasj 458 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments aditya333 commented Jan 16, 2019 reply Follow Share from my understanding a cycle graph consists of a single cycle.But our graph can contain multiple cycles and components.Hence 1 is the most suitable option 1 votes 1 votes Chaitrasj commented Jan 16, 2019 reply Follow Share Yess we can have a graph with 2 components such that each component is $C_4$. In this case all other options are true, but 1 is becoming False it's not a cycle graph.. Thanks! 0 votes 0 votes Deepalitrapti commented Jun 18, 2019 reply Follow Share C4 is a 2 regular graph and cycle contain then how 1 statement is false? 0 votes 0 votes Please log in or register to add a comment.