Pages that link to "Item:Q6047966"
From MaRDI portal
The following pages link to Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable (Q6047966):
Displaying 8 items.
- List total coloring of pseudo-outerplanar graphs (Q393451) (← links)
- On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
- Every graph is \((2,3)\)-choosable (Q519997) (← links)
- Total choosability of planar graphs with maximum degree 4 (Q617905) (← links)
- Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable (Q1043786) (← links)
- Total choosablility of planar graphs with maximum degree 5 (Q2858682) (← links)
- Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable (Q5419972) (← links)
- Square Coloring Planar Graphs with Automatic Discharging (Q6141869) (← links)