Pages that link to "Item:Q2005734"
From MaRDI portal
The following pages link to Choosability with union separation of triangle-free planar graphs (Q2005734):
Displaying 5 items.
- On \((3, r)\)-choosability of some planar graphs (Q2117577) (← links)
- Choosability with union separation of planar graphs without cycles of length 4 (Q2656689) (← links)
- Coloring squares of planar graphs with maximum degree at most five (Q2689129) (← links)
- On \(L (p, q)\)-labelling of planar graphs without cycles of length four (Q2698183) (← links)
- List 4-colouring of planar graphs (Q6170786) (← links)
