Pages that link to "Item:Q2858682"
From MaRDI portal
The following pages link to Total choosablility of planar graphs with maximum degree 5 (Q2858682):
Displaying 7 items.
- On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
- Total choosability of planar graphs with maximum degree 4 (Q617905) (← links)
- Locally planar graphs are 5-choosable (Q958683) (← links)
- Every planar graph is 5-choosable (Q1333334) (← links)
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable (Q1633752) (← links)
- 2-distance choosability of planar graphs with a restriction for maximum degree (Q2698256) (← links)
- Graphs of degree 4 are 5-edge-choosable (Q4718735) (← links)