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

Displayed 8 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 cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) ‎ (← 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)
• 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)
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) ‎ (← links)