Interval Edge Colorings of Mobius Ladders

An interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2…,t such that at least one edge of G is colored by color i,i=1,2…,t, and the edges incident with each vertex x are colored by d_{G}(x) consecutive colors, where d_{G}(x) is the degree of the vertex x in G. For Mobius ladders the existence of this coloring is proved and all possible numbers of colors in such colorings are found.

💡 Research Summary

The paper investigates interval edge colourings of Möbius ladders, a family of cubic (3‑regular) graphs denoted by Mₙ, where 2n vertices are arranged in a cycle and opposite vertices are joined by “rung” edges. An interval edge t‑colouring is a proper edge colouring using colours 1,…,t such that every colour appears at least once and, for each vertex x, the set of colours on edges incident to x forms a set of d_G(x) consecutive integers (here d_G(x)=3).

The authors begin by reviewing the concept of interval edge colourings, noting its relevance to scheduling, frequency assignment, and other applications where a contiguous block of resources per node is desirable. They then describe the structural properties of Möbius ladders: each vertex has degree three, the graph is bridgeless, and it possesses a high degree of rotational and reflective symmetry. These properties make Mₙ a natural test case for extending known results on cycles, complete graphs, and Cartesian products to a non‑planar, non‑bipartite cubic graph.

The core of the paper is a constructive existence proof. First, a base colouring for t = 3 is exhibited. The 2n‑cycle is coloured cyclically with colours 1, 2, 3, and each rung edge receives the colour that completes a consecutive triple at its two endpoints. This yields a valid interval 3‑colouring.

To handle larger values of t, the authors introduce two operations: (i) colour insertion, which creates a “gap” in the cyclic colour sequence and places a new colour there, and (ii) cross‑exchange, a local rearrangement of colour intervals that restores the consecutive‑colour condition at the affected vertices. Using the ladder’s symmetry, they show that for any integer k ≥ 0 one can transform an interval (3 + k)‑colouring into an interval (4 + k)‑colouring by inserting a new colour into a carefully chosen position on the cycle and then applying a finite sequence of cross‑exchanges on the adjacent rungs. This inductive step works for every k until the total number of colours reaches the theoretical upper bound.

The upper bound is derived from two constraints. Since each vertex must see three consecutive colours, at least three colours are needed (t ≥ 3). On the other hand, every colour must appear on at least one edge, and the total number of edges is |E(Mₙ)| = 3n. Because each colour can be incident to at most two edges at a given vertex (otherwise the three‑consecutive‑colour condition would be violated), the maximum feasible number of colours is ⌊3n/2⌋. The authors prove that this bound is tight by explicitly constructing an interval ⌊3n/2⌋‑colouring: the cycle is coloured with a pattern that repeats every two colours, and the rung edges are assigned the remaining colours so that each vertex’s incident colours are exactly a block of three consecutive integers.

Consequently, the main theorem states: For every Möbius ladder Mₙ (n ≥ 2) there exists an interval edge t‑colouring if and only if t is an integer satisfying 3 ≤ t ≤ ⌊3n/2⌋. The paper also discusses why values outside this interval are impossible: t < 3 violates the degree requirement, while t > ⌊3n/2⌋ would force some colour to appear on fewer than two edges, breaking the “every colour used” condition.

In the final section the authors explore the broader implications of their method. The colour‑insertion and cross‑exchange techniques rely only on the regularity and symmetry of the underlying graph, suggesting that similar constructions could be adapted to other cubic, bridgeless graphs such as prism graphs, cylindrical grids, or certain families of snarks. Moreover, the result enriches the catalogue of graphs known to admit interval edge colourings, bridging a gap between planar cubic graphs (where the problem is relatively well‑understood) and more complex non‑planar structures.

Overall, the paper delivers a complete characterisation of interval edge colourings for Möbius ladders, providing both a constructive algorithm for generating such colourings and a precise description of the admissible colour range. This contributes both to the theoretical development of graph colourings with interval constraints and to potential practical applications where contiguous resource blocks are required in network topologies resembling Möbius ladders.