Altitude of 4-Regular Circulants

The altitude (G) of a graph G is the largest integer k such that for each linear ordering f of its edges, G has a (simple) path P of length k for which f increases along its edge sequence. The altitude of G is bounded above by its chromatic index 0 (G) . Sometimes G admits an edge ordering that real... View More