Pages that link to "Item:Q501066"

The following pages link to The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066):

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)
• Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
• \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) (Q2075512) (← links)
• On 3-colorable planar graphs without cycles of four lengths (Q2379960) (← links)
• Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905) (← links)
• On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles (Q2859766) (← links)
• Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable (Q5064172) (← links)
• Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable (Q5351865) (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) (← links)
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
• Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable (Q6606324) (← links)