A sufficient condition for a planar graph to be 3-choosable (Q2380013): Difference between revisions
From MaRDI portal
Latest revision as of 15:25, 2 July 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