Pages that link to "Item:Q2444905"

The following pages link to Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905):

Displaying 17 items.

• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
• Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724) (← links)
• \((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 short even cycles are near-bipartite (Q777449) (← links)
• Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)
• Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563) (← links)
• \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) (Q2075512) (← links)
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) (← links)
• Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs (Q2324512) (← 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)
• Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable (Q2449160) (← links)
• Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable (Q5064172) (← links)
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
• Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable (Q6585244) (← links)
• A sufficient condition for planar graphs with girth 5 to be \((1,6)\)-colorable (Q6585548) (← links)