Pages that link to "Item:Q407575"

The following pages link to On the total choosability of planar graphs and of sparse graphs (Q407575):

Displaying 8 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)
• List edge colorings of planar graphs without adjacent 7-cycles (Q2035728) (← links)
• A structural theorem for planar graphs with some applications (Q2275921) (← links)
• A note on list edge and list total coloring of planar graphs without adjacent short cycles (Q2440495) (← links)
• List edge and list total coloring of planar graphs without intersecting 8-cycles (Q5034571) (← links)