<s>[INST] Let \(G\) be a graph with \(n\) vertices. Suppose that any two adjacent vertices \(v_{1},\,v_{2}\) have degrees that differ by at most \(1\). Show that the vertices of \(G\) can be ordered so that adjacent vertices have indices that differ by at most \(1\). Help yourself to any graph theory needed.[/INST]