Neighbourhood of a vertex in a k-critical graph... proof question....?

Jennie

New member
The question is this:

The neighbourhood of a vertex, v , is the set of all neighbours of v, given by N(v).

Prove that if u, v belong to V in a k-critical graph G, then N(u) is NOT a subset of N(v)
 
Back
Top