GATE CS Graphs: Connectivity, Matching, Colouring questions
Practise Graphs: Connectivity, Matching, Colouring questions for GATE CS. Explore official PYQs and original topic-wise quizzes, check answers and view available solutions. Free, no sign-in.
Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.
5 on this page
The minimum number of edges in a connected cyclic graph on vertices is:
The number of distinct simple graphs with up to three nodes is
Consider a simple connected graph with vertices and edges . Then, which of the following statements are true?
A non-planar graph with minimum number of vertices has
A graph is planar if and only if,