Pages that link to "Item:Q526822"
From MaRDI portal
The following pages link to A sufficient condition for a planar graph to be 4-choosable (Q526822):
Displaying 8 items.
- A new sufficient condition for a toroidal graph to be 4-choosable (Q1660275) (← links)
- DP-4-coloring of planar graphs with some restrictions on cycles (Q1981697) (← links)
- Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable (Q1988544) (← links)
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- \((4,1)^*\)-choosability of planar graphs (Q2719962) (← links)
- THE EXISTENCE CONDITION OF A 4-CONNECTED GRAPH WITH SPECIFIED CONFIGURATIONS (Q5208621) (← links)
- Variable degeneracy on toroidal graphs (Q6143693) (← links)