The following pages link to (Q2760437):
Displayed 5 items.
- Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← links)
- DP-4-coloring of planar graphs with some restrictions on cycles (Q1981697) (← links)
- The 4-choosability of planar graphs and cycle adjacency (Q1981715) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- Toroidal graphs containing neither nor 6‐cycles are 4‐choosable (Q5272640) (← links)