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