The 4-choosability of planar graphs without 6-cycles (Q2760437)
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 1684675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The 4-choosability of planar graphs without 6-cycles |
scientific article; zbMATH DE number 1684675 |
Statements
2 January 2002
0 references
planar graph
0 references
color
0 references
The 4-choosability of planar graphs without 6-cycles (English)
0 references
The authors prove that every planar graph with no cycle of length \(6\) is \(4\)-choosable, that is, if a list of four colors is associated with every vertex, then it is possible to color each vertex with a color from its list so that neighboring vertices always receive distinct colors.
0 references
0.9385988712310792
0 references
0.9105230569839478
0 references
0.9073970913887024
0 references
0.9069854021072388
0 references
0.9069280624389648
0 references
