109 citations · 453 across the 60 of their papers we have counts for
1 paper · 1 filter
Nathan Bowler, Johannes Carmesin, Péter Komjáth +1
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 wi…