On graphs double-critical with respect to the colouring number

Matthias Kriesell, Anders Sune Pedersen

The colouring number col(G) of a graph G is the smallest integer k for which there is an ordering of the vertices of G such that when removing the vertices of G in the specified or…