Pages that link to "Item:Q738860"

The following pages link to Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860):

Displaying 2 items.

• Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← links)
• A relaxation of Novosibirsk 3-color conjecture (Q2075515) (← links)