Pages that link to "Item:Q407575"
From MaRDI portal
The following pages link to On the total choosability of planar graphs and of sparse graphs (Q407575):
Displaying 4 items.
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709) (← links)
- Total choosability of planar graphs with maximum degree 4 (Q617905) (← links)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- List-edge-coloring of planar graphs without 6-cycles with three chords (Q1702837) (← links)
