Pages that link to "Item:Q393460"

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

Displayed 23 items.

• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) ‎ (← 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 adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) ‎ (← 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)
• 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)
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable (Q2115229) ‎ (← links)
• New restrictions on defective coloring with applications to Steinberg-type graphs (Q2185826) ‎ (← 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)
• Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905) ‎ (← links)
• \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 (Q2449153) ‎ (← 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)
• Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) ‎ (← links)
• 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable (Q6137013) ‎ (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) ‎ (← links)