A note on planar 5-list colouring: Non-extendability at distance 4
The authors give a construction providing a negative answer to the following question of \textit{M. O. Albertson} [J. Comb. Theory, Ser. B 73, 189-194 (1998; Zbl 0910.05026)]: Suppose that \(G\) is a planar graph and each vertex of \(G\) has been assigned a list of 5 colors. Let \(W\subseteq V(G)\) be such that the distance between any two vertices in \(W\) is at least 4. Can any list coloring of \(W\) be extended to a list coloring of \(G\)?
scientific article; zbMATH DE number 1792410