The complexity of planar graph choosability (Q1126188)
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 complexity of planar graph choosability |
scientific article; zbMATH DE number 955087
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of planar graph choosability |
scientific article; zbMATH DE number 955087 |
Statements
The complexity of planar graph choosability (English)
0 references
18 June 1997
0 references
Margit Voigt gave examples of a planar graph which is not 4-choosable and a planar triangle-free graph which is not 3-choosable. The present author presents simpler examples. He also proves that the corresponding decision problems for planar graphs are NP-hard.
0 references
choosability
0 references
planar graph
0 references
decision problems
0 references
NP-hard
0 references
