Pages that link to "Item:Q2380013"

The following pages link to A sufficient condition for a planar graph to be 3-choosable (Q2380013):

Displayed 5 items.

• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363) ‎ (← links)
• Some structural properties of planar graphs and their applications to 3-choosability (Q658061) ‎ (← links)
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) ‎ (← links)
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) ‎ (← links)
• A note on 3-choosability of planar graphs (Q2380076) ‎ (← links)