Fig. 2From: Complexity of greedy edge-colouringThe graph G ′ obtained from a cubic graph H Back to article page