Pages that link to "Item:Q1043995"

The following pages link to On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995):

Displaying 12 items.

• Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (Q324868) (← links)
• \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
• The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066) (← links)
• Three-coloring planar graphs without short cycles (Q845915) (← links)
• On 3-colorable plane graphs without 5- and 7-cycles (Q859619) (← links)
• \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) (Q2075512) (← links)
• Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
• On 3-colorable planar graphs without cycles of four lengths (Q2379960) (← links)
• On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles (Q2859766) (← links)
• (Q4684518) (← links)
• Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable (Q5351865) (← links)
• Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable (Q6606324) (← links)