Pages that link to "Item:Q1045155"

The following pages link to Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155):

Displaying 3 items.

• \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
• 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)