Pages that link to "Item:Q2947439"
From MaRDI portal
The following pages link to Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable (Q2947439):
Displaying 10 items.
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- List-edge-coloring of planar graphs without 6-cycles with three chords (Q1702837) (← links)
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 (Q2194528) (← links)
- List edge coloring of planar graphs without 6-cycles with two chords (Q2214317) (← links)
- Edge DP-coloring in planar graphs (Q2659224) (← links)
- Maximum average degree of list-edge-critical graphs and Vizing's conjecture (Q5054037) (← links)
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable (Q6047966) (← links)
- Kempe equivalent list edge-colorings of planar graphs (Q6091809) (← links)
- Sufficient conditions make graphs edge DP-\(\varDelta\)-colorable (Q6660052) (← links)
