A sufficient condition for a planar graph to be 3-choosable (Q2380013): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q977285 |
Changed an Item |
||
| Property / author | |||
| Property / author: Ying Qian Wang / rank | |||
Normal rank | |||
Revision as of 16:07, 21 February 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
