GATEverse Practice, past papers & mock tests
GATE 2016 · CS2 - Afternoon
Engineering MathematicsGraph TheorymediumNAT1 mark
The minimum number of colours that is sufficient to vertex-colour any planar graph is _______
Save your progress

Related Engineering Mathematics PYQs