Pages that link to "Item:Q1679498"
From MaRDI portal
The following pages link to A sufficient condition for planar graphs to be (3,1)-choosable (Q1679498):
Displayed 4 items.
- On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (Q1999744) (← links)
- Choosability with separation of planar graphs without prescribed cycles (Q2284787) (← 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)