A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:49, 30 January 2024
scientific article
| 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 |
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
