GATE CS 2026 (Forenoon) — Question 55

Discrete MathematicsGraph Theory (Connectivity, Paths, Cycles, Trees)MSQ2 marksMedium

An undirected, unweighted, simple graph \( G(V, E) \) is said to be 2-colorable if there exists a function \( c : V \rightarrow \{0, 1\} \) such that for every \( (u, v) \in E \), \( c(u) \neq c(v) \). Which of the following statements about 2-colorable graphs is/are true?
  1. A
    If \( G \) is 2-colorable, then \( G \) may contain cycles of odd length
  2. B
    If \( G \) is 2-colorable, then \( G \) may contain cycles of even length
  3. C
    An optimal algorithm for testing whether \( G \) is 2-colorable runs in time \( \theta(|V| + |E|) \), if \( G \) is represented as an adjacency list
  4. D
    An optimal algorithm for testing whether \( G \) is 2-colorable runs in time \( \theta(|E| \log |V|) \), if \( G \) is represented as an adjacency list
Practise the full 2026-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Graph Theory (Connectivity, Paths, Cycles, Trees)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group