On nearly regular co-critical graphs

A graph G is called (K3, K3)-co-critical if the edges of G can be coloured with two colours without getting a monochromatic triangle, but adding any new edge to the graph, this kind of ‘good’ colouring is impossible. In this short note we construct (K3, K3)-co-critical graphs of maximal degree O(n34).