13 citations · 115 across the 49 of their papers we have counts for
3 papers · 1 filter
5-list-coloring planar graphs with distant precolored vertices
Zdenek Dvorak, Bernard Lidicky, Bojan Mohar +1
We answer positively the question of Albertson asking whether every planar graph can be -list-colored even if it contains precolored vertices, as long as they are sufficiently f…
Five-coloring graphs on the Klein bottle
Nathan Chenette, Luke Postle, Noah Streib +2
We exhibit an explicit list of nine graphs such that a graph drawn in the Klein bottle is 5-colorable if and only if it has no subgraph isomorphic to a member of the list.
The structure of 2-separations of infinite matroids
Elad Aigner-Horev, Reinhard Diestel, Luke Postle
Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors…