 When "n" ≡ 0 (mod 4), it is not bipartite.The endpoints of each rung are an even distance apart in the initial cycle, so adding each rung creates an odd cycle.In this case, because the graph is 3-regular but not bipartite, by Brooks' theorem it has chromatic number 3. show that the Möbius ladders are uniquely determined by their Tutte polynomials.