The colouring number of infinite graphs

We show that, given an infinite cardinal μ, a graph has colouring number at most μ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its vertices that simultaneously witnesses its colouring number and its cardinality.