Pages that link to "Item:Q1679498"

The following pages link to A sufficient condition for planar graphs to be (3,1)-choosable (Q1679498):

Displaying 12 items.

• Planar graphs have independence ratio at least 3/13 (Q311579) (← links)
• Every graph is \((2,3)\)-choosable (Q519997) (← links)
• On choosability with separation of planar graphs without adjacent short cycles (Q723623) (← links)
• On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (Q1999744) (← links)
• On \((3, r)\)-choosability of some planar graphs (Q2117577) (← links)
• Choosability with separation of planar graphs without prescribed cycles (Q2284787) (← links)
• On choosability with separation of planar graphs with lists of different sizes (Q2346342) (← links)
• Choosability with union separation of planar graphs without cycles of length 4 (Q2656689) (← links)
• On \(L (p, q)\)-labelling of planar graphs without cycles of length four (Q2698183) (← links)
• On choosability with separation of planar graphs with forbidden cycles (Q2800544) (← links)
• (Q4642877) (← links)
• (Q5016040) (← links)