Pages that link to "Item:Q963412"

The following pages link to A relaxation of Havel's 3-color problem (Q963412):

Displaying 3 items.

• Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
• Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
• Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)