Pages that link to "Item:Q489724"

The following pages link to Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724):

Displaying 17 items.

• \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
• Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920) (← links)
• Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)
• Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126) (← links)
• Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563) (← links)
• Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable (Q2012890) (← links)
• \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) (Q2075512) (← links)
• A relaxation of Novosibirsk 3-color conjecture (Q2075515) (← links)
• Every planar graph with girth at least 5 is \((1,9)\)-colorable (Q2124609) (← 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)
• A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable (Q2359791) (← links)
• Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable (Q2359954) (← links)
• Improper colorability of planar graphs without prescribed short cycles (Q2436833) (← links)
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) (← links)
• Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) (← links)