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):

Displaying 10 items.

• \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
• Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
• Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
• Planar graphs are \(9/2\)-colorable (Q1791701) (← links)
• A relaxation of Novosibirsk 3-color conjecture (Q2075515) (← links)
• Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← links)
• Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs (Q2324512) (← links)
• Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable (Q2449160) (← links)
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) (← links)
• Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable (Q5064172) (← links)