A note on list improper coloring planar graphs (Q5938913)
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: A note on list improper coloring planar graphs |
scientific article; zbMATH DE number 1631129
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on list improper coloring planar graphs |
scientific article; zbMATH DE number 1631129 |
Statements
A note on list improper coloring planar graphs (English)
0 references
7 August 2001
0 references
It is proved that every plane graph without 4-cycles and 5-cycles is \((3,1)^*\)-choosable. This result may be regarded as a solution to a weakened form of Steinberg's 3-colour conjecture.
0 references
vertex colouring
0 references
plane graph
0 references
0 references
