Pages that link to "Item:Q710613"
From MaRDI portal
The following pages link to Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613):
Displaying 10 items.
- Group edge choosability of planar graphs without adjacent short cycles (Q381084) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- List-edge-colouring planar graphs with precoloured edges (Q1621065) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- Plane graphs with maximum degree 9 are entirely 11-choosable (Q2629286) (← links)
- Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable (Q2947439) (← links)
- Maximum average degree of list-edge-critical graphs and Vizing's conjecture (Q5054037) (← links)
- Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable (Q5419972) (← links)
- Extremal \(P_8\)-free/\(P_9\)-free planar graphs (Q6047577) (← links)
- Kempe equivalent list edge-colorings of planar graphs (Q6091809) (← links)
