Pages that link to "Item:Q2323250"
From MaRDI portal
The following pages link to Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250):
Displaying 5 items.
- DP-4-coloring of planar graphs with some restrictions on cycles (Q1981697) (← links)
- DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
- On \((3, r)\)-choosability of some planar graphs (Q2117577) (← links)
- Planar graphs without normally adjacent short cycles (Q2144582) (← links)
- Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068) (← links)
