Pages that link to "Item:Q1999744"

The following pages link to On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (Q1999744):

Displaying 10 items.

• A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497) (← links)
• On choosability with separation of planar graphs without adjacent short cycles (Q723623) (← links)
• Retracted article: ``On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles'' (Q1675871) (← links)
• A sufficient condition for planar graphs to be (3,1)-choosable (Q1679498) (← links)
• Choosability with separation of planar graphs without prescribed cycles (Q2284787) (← links)
• Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
• On \(( 2 , r )\)-choosability of planar graphs without short cycles (Q2698091) (← links)
• On choosability with separation of planar graphs with forbidden cycles (Q2800544) (← links)
• (Q3011725) (← links)
• List 4-colouring of planar graphs (Q6170786) (← links)