A note on planar 5-list colouring: Non-extendability at distance 4
type: Item
instance of: scholarly article
title: A note on planar 5-list colouring: Non-extendability at distance 4
zbMATH Open document ID: 1002.05020
DOI: 10.1016/S0012-365X(01)00338-7
author: Zsolt Tuza
author: Margit Voigt
published in: Discrete Mathematics
publication date: 2002-08-29T00:00:00Z
review text: 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\)?
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1792410
zbMATH Keywords: planar graph
zbMATH Keywords: list coloring
zbMATH Keywords: distance
reviewed by: Fedor V. Fomin
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1792410