Pages that link to "Item:Q721920"

The following pages link to Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920):

Displaying 8 items.

• 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)
• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126) (← links)
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565) (← links)
• Planar graphs without 4- and 6-cycles are (7 : 2)-colorable (Q2185814) (← links)
• Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs (Q2324512) (← 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)