GATE Computer Science (CS) 2016 Shift 2 Solved Paper

Question : 13 of 65

Marks: +1, -0

The minimum number of colours that is sufficient to vertex-colour any planar graph is_______.