Pages that link to "Item:Q898165"

The following pages link to Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165):

Displayed 11 items.

• Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920) ‎ (← links)
• Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) ‎ (← links)
• Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) ‎ (← links)
• Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563) ‎ (← links)
• A relaxation of Novosibirsk 3-color conjecture (Q2075515) ‎ (← links)
• Every planar graph with girth at least 5 is \((1,9)\)-colorable (Q2124609) ‎ (← links)
• (Q2231768) (redirect page) ‎ (← links)
• Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) ‎ (← links)
• Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable (Q2279984) ‎ (← links)
• A relaxation of the Bordeaux conjecture (Q2349972) ‎ (← links)
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) ‎ (← links)