Pages that link to "Item:Q2800544"
From MaRDI portal
The following pages link to On choosability with separation of planar graphs with forbidden cycles (Q2800544):
Displaying 15 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)
- 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)
- \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)
- Choosability with union separation of planar graphs without cycles of length 4 (Q2656689) (← links)
- A note on choosability with separation for planar graphs. (Q2716011) (← links)
- (Q3469114) (← links)
- IC-Planar Graphs Are 6-Choosable (Q5009330) (← links)
- Separation Choosability and Dense Bipartite Induced Subgraphs (Q5222550) (← links)
- List 4-colouring of planar graphs (Q6170786) (← links)
