Pages that link to "Item:Q2475310"

The following pages link to Planar graphs without 4, 6, 8-cycles are 3-colorable (Q2475310):

Displaying 24 items.

• \((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)
• Planar graphs without cycles of specific lengths (Q697075) (← links)
• Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
• A non-3-choosable planar graph without cycles of length 4 and 5 (Q868377) (← links)
• Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable (Q932660) (← links)
• On 3-colorable planar graphs without short cycles (Q998606) (← links)
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) (← links)
• Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (Q1686009) (← links)
• A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
• Planar graphs without normally adjacent short cycles (Q2144582) (← links)
• Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable (Q2323251) (← links)
• Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
• Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905) (← links)
• Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068) (← links)
• Three coloring planar graphs without cycles of length from 4 to 6 or seven cycles with close triangles (Q2857451) (← links)
• On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles (Q2859766) (← links)
• 3-Paintability of planar graphs (Q4554554) (← links)
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
• 3-Coloring graphs embedded in surfaces (Q4948508) (← 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)