Concept drill

kuratowski-theorem

GATE CSE & IT · Graph Theory · 1990-2007

PYQs

100%

keyed

elite explanations

years appeared

Study anchor

Rosen — Discrete Mathematics and Its Applications

Discrete structures, counting, relations, graph theory

Let $$G$$ be the non-planar graph with minimum possible number of edges. Then $$G$$ has

A non-planar graph with minimum number of vertices has

A graph is planar if and only if,