The following pages link to (Q5442386):
Displaying 8 items.
- A non-3-choosable planar graph without cycles of length 4 and 5 (Q868377) (← links)
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077) (← links)
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
- Choice numbers of multi-bridge graphs (Q1650388) (← links)
- Retracted article: ``On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles'' (Q1675871) (← links)
- On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs (Q1751381) (← links)
- A note on 3-choosability of planar graphs without certain cycles (Q2566160) (← links)
- Plane graphs with maximum degree 9 are entirely 11-choosable (Q2629286) (← links)
