Pages that link to "Item:Q723623"
From MaRDI portal
The following pages link to On choosability with separation of planar graphs without adjacent short cycles (Q723623):
Displaying 13 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)
- A sufficient condition for planar graphs to be (3,1)-choosable (Q1679498) (← links)
- On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (Q1999744) (← links)
- Choosability with union separation of triangle-free planar graphs (Q2005734) (← 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 \(( 2 , r )\)-choosability of planar graphs without short cycles (Q2698091) (← links)
- A note on choosability with separation for planar graphs. (Q2716011) (← links)
- On choosability with separation of planar graphs with forbidden cycles (Q2800544) (← links)
- (Q3469114) (← links)
