Pages that link to "Item:Q617905"

The following pages link to Total choosability of planar graphs with maximum degree 4 (Q617905):

Displaying 11 items.

• On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
• (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709) (← links)
• Total 4-choosability of series-parallel graphs (Q870016) (← links)
• \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)
• A note on list edge and list total coloring of planar graphs without adjacent short cycles (Q2440495) (← links)
• The maximum number of paths of length four in a planar graph (Q2659227) (← links)
• 2-distance choosability of planar graphs with a restriction for maximum degree (Q2698256) (← links)
• \((4,1)^*\)-choosability of planar graphs (Q2719962) (← links)
• Total choosablility of planar graphs with maximum degree 5 (Q2858682) (← links)
• Some totally 4-choosable multigraphs (Q3504798) (← links)
• Graphs of degree 4 are 5-edge-choosable (Q4718735) (← links)