GATE CS 2020 (Forenoon) — Question 62

Discrete MathematicsAdvanced Graph Bounds (Matching, Coloring Theorems)NAT2 marksMedium

Graph \( G \) is obtained by adding vertex \( s \) to \( K_{3, 4} \) and making \( s \) adjacent to every vertex of \( K_{3, 4} \). The minimum number of colours required to edge-colour \( G \) is ________.
Practise the full 2020-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
Practise more on Advanced Graph Bounds (Matching, Coloring Theorems)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