A note on the not 3-choosability of some families of planar graphs (Q845679): 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.2005.10.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2159607383 / rank | |||
Normal rank | |||
Revision as of 21:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the not 3-choosability of some families of planar graphs |
scientific article |
Statements
A note on the not 3-choosability of some families of planar graphs (English)
0 references
29 January 2010
0 references
combinatorial problems
0 references
coloring
0 references
list-coloring
0 references
choosability
0 references
