Planar Graphs without 7-Cycles Are 4-Choosable (Q3583295)
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 5775347
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar Graphs without 7-Cycles Are 4-Choosable |
scientific article; zbMATH DE number 5775347 |
Statements
Planar Graphs without 7-Cycles Are 4-Choosable (English)
0 references
27 August 2010
0 references
planar graphs
0 references
coloring
0 references
choosability
0 references
0.94677943
0 references
0.9358561
0 references
0.9355889
0 references
0.93535954
0 references
0.93053895
0 references
0 references
0.9273432
0 references
0.92708516
0 references
0.9267383
0 references
0.92643726
0 references
