A graph, $|G| \geq 3$ such that $\forall d < n/2$ , $|\{v \in V(G) : deg(v) \leq d\}| < d $ then G has a Hamilton cycle.

I'm not sure where to start, or what the second requirement suggests.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.