Pages that link to "Item:Q2323250"

The following pages link to Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250):

Displaying 12 items.

• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363) (← links)
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
• On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
• Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (Q1686009) (← links)
• DP-4-coloring of planar graphs with some restrictions on cycles (Q1981697) (← links)
• DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
• On \((3, r)\)-choosability of some planar graphs (Q2117577) (← links)
• Planar graphs without normally adjacent short cycles (Q2144582) (← links)
• Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068) (← links)
• (Q3099255) (← links)
• Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable (Q5419972) (← links)