The list chromatic numbers of some planar graphs (Q1288297)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The list chromatic numbers of some planar graphs |
scientific article; zbMATH DE number 1286444
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The list chromatic numbers of some planar graphs |
scientific article; zbMATH DE number 1286444 |
Statements
The list chromatic numbers of some planar graphs (English)
0 references
24 September 1999
0 references
The list chromatic number of various classes of planar graphs is determined. In particular, it is proved that the list chromatic number of a connected outerplanar graph with at least two vertices is 2 if the graph is bipartite with at most one cycle, and 3 otherwise. Results of a similar nature are proved for 1-trees (planar graphs that can be made acyclic by the removal of a vertex) and for 1-outerplanar graphs (planar graphs that can be made outerplanar by the removal of a vertex).
0 references
list chromatic number
0 references
choosability
0 references
planar graph
0 references
