Pages that link to "Item:Q738863"

The following pages link to Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863):

Displaying 2 items.

• A new sufficient condition for a toroidal graph to be 4-choosable (Q1660275) (← links)
• Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable (Q1712501) (← links)