A sufficient condition for a planar graph to be 3-choosable (Q2380013): 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.2007.06.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031219849 / rank | |||
Normal rank | |||
Revision as of 01:44, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for a planar graph to be 3-choosable |
scientific article |
Statements
A sufficient condition for a planar graph to be 3-choosable (English)
0 references
24 March 2010
0 references
combinatorial problems
0 references
planar graph
0 references
cycle
0 references
choosability
0 references
