The skew chromatic index of a graph (Q791534)

A skew edge colouring of a graph G is a pair of edge colourings of G such that no two edges are assigned the same unordered pair of colours. The skew chromatic index s(G) is the minimum number of colours required for a skew edge colouring of G. It is shown that s(G) is at most \(0(G)+4\). Better bounds are obtained when G is cyclic, cubic or bipartite.