GATE Computer Science (CS) 2020 Solved Papers

Question : 55 of 65

Marks: +1, -0

Graph

{G}

is obtained by adding vertex

{s}

{K}_{3,4}

and making

{s}

adjacent to every vertex of

{K}_{3,4}

. The minimum number of colours required to edge-colour is G______ .

Go to Question:

Prev Question

Next Question