A sufficient condition for a planar graph to be 3-choosable (Q2380013): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Colorings and orientations of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The 3-choosability of plane graphs of girth 4 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every planar graph is 5-choosable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 3-list-coloring planar graphs of girth 5 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: List colourings of planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bordeaux 3-color conjecture and 3-choosability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the not 3-choosability of some families of planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on 3-choosability of planar graphs without certain cycles / rank | |||
Normal rank |
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