Pages that link to "Item:Q898156"

The following pages link to Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156):

Displayed 15 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)
• Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) ‎ (← 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)
• New restrictions on defective coloring with applications to Steinberg-type graphs (Q2185826) ‎ (← 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)
• Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable (Q2359954) ‎ (← links)
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) ‎ (← links)
• Note on improper coloring of $1$-planar graphs (Q5206449) ‎ (← links)
• Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) ‎ (← links)