Pages that link to "Item:Q629363"

The following pages link to Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363):

Displaying 9 items.

• \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
• Some structural properties of planar graphs and their applications to 3-choosability (Q658061) (← links)
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) (← links)
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
• Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate (Q1981692) (← links)
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) (Q2000564) (← links)
• DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
• Planar graphs without specific cycles are 2-degenerate (Q2037563) (← links)
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)