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.
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.
Copyright © 2021 JogjaFile Inc.