Pages that link to "Item:Q5419972"
From MaRDI portal
The following pages link to Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable (Q5419972):
Displaying 5 items.
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- Edge-colouring eight-regular planar graphs (Q491001) (← links)
- List-edge-colouring planar graphs with precoloured edges (Q1621065) (← links)
- Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable (Q2947439) (← links)
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable (Q6047966) (← links)