Pages that link to "Item:Q2397522"
From MaRDI portal
The following pages link to Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522):
Displayed 8 items.
- DP-4-coloring of planar graphs with some restrictions on cycles (Q1981697) (← links)
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles (Q2075538) (← links)
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
- On \((3, r)\)-choosability of some planar graphs (Q2117577) (← links)
- List coloring and diagonal coloring for plane graphs of diameter two (Q2286099) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- Planar graphs without intersecting 5-cycles are signed-4-choosable (Q5101876) (← links)
- A sufficient condition for planar graphs to be <i>DP</i>-4-colorable (Q6075728) (← links)