A note on planar 5-list colouring: Non-extendability at distance 4 (Q1613480)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1792410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on planar 5-list colouring: Non-extendability at distance 4 |
scientific article; zbMATH DE number 1792410 |
Statements
A note on planar 5-list colouring: Non-extendability at distance 4 (English)
0 references
29 August 2002
0 references
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\)?
0 references
planar graph
0 references
list coloring
0 references
distance
0 references
0.859813928604126
0 references
0.8342372179031372
0 references
0.8178793787956238
0 references
0.8115639686584473
0 references
0.7918322682380676
0 references
