2 citations · 2 across the 1 of their papers we have counts for
1 paper
Victor Campos, Frédéric Havet
We show that every graph with two crossings is 5-choosable. We also prove that every graph which can be made planar by removing one edge is 5-choosable.