A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410)
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 smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable |
scientific article; zbMATH DE number 5719159
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable |
scientific article; zbMATH DE number 5719159 |
Statements
A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (English)
0 references
9 June 2010
0 references
combinatorial problems
0 references
planar graph
0 references
list coloring
0 references
3-choosable
0 references
0.9245953
0 references
0.9245912
0 references
0.91747844
0 references
0.91019803
0 references
0.9092746
0 references
0.9023597
0 references
0.89884865
0 references
0.89766484
0 references
