A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2008.04.004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2090111770 / rank | |||
Normal rank |
Revision as of 03:43, 20 March 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