Pages that link to "Item:Q2719962"

The following pages link to \((4,1)^*\)-choosability of planar graphs (Q2719962):

Displaying 7 items.

• A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497) (← links)
• On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles (Q741735) (← links)
• Planar graphs are 1-relaxed, 4-choosable (Q976159) (← links)
• List improper colorings of planar graphs with prescribed girth (Q1972143) (← links)
• The 4-choosability of planar graphs and cycle adjacency (Q1981715) (← links)
• Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
• \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)