Pages that link to "Item:Q2359954"

The following pages link to Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable (Q2359954):

Displayed 3 items.

• Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) ‎ (← links)
• A relaxation of Novosibirsk 3-color conjecture (Q2075515) ‎ (← links)
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) ‎ (← links)